Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 74 matches
- 2012
- Shani Alkoby, David Sarne, Esther David:
On the Choice of Obtaining and Disclosing the Commonvalue in Auctions. IAT 2012: 111-118 - Amos Azaria, David Sarne, Yonatan Aumann:
Distributed Matching with Mixed Maximum-Minimum Utilities. IAT 2012: 134-139 - Nesrine Bessghaier, Mahdi Zargayouna, Flavien Balbo:
Online Localized Resource Allocation Application to Urban Parking Management. IAT 2012: 67-74 - Tibor Bosse, Robbert-Jan Merk, Jan Treur:
Integrating Situation Awareness and Surprise: A Computational Agent Model. IAT 2012: 430-435 - Fiemke Both, Mark Hoogendoorn, Michel C. A. Klein:
Validation of a Model for Coping and Mood for Virtual Agents. IAT 2012: 382-389 - Stefano Bromuri:
A Tensor Factorization Approach to Generalization in Multi-agent Reinforcement Learning. IAT 2012: 274-281 - Yin Chan, XinJun Mao, Cuiyun Hu, Huiping Zhou, Jianmin Zhao:
Oragentburg: A Platform Supporting Organisation-Based Programming. IAT 2012: 366-373 - Jian Chen, Guanliang Chen, Hao Lan Zhang, Jin Huang, Gansen Zhao:
Social Recommendation Based on Multi-relational Analysis. IAT 2012: 471-477 - Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau:
A Mechanism for Organizing Last-Mile Service Using Non-dedicated Fleet. IAT 2012: 85-89 - Erkin Çilden, Faruk Polat:
Abstraction in Model Based Partially Observable Reinforcement Learning Using Extended Sequence Trees. IAT 2012: 348-355 - Nicolas Côté, Arnaud Canu, Maroua Bouzid, Abdel-Illah Mouaddib:
Humans-Robots Sliding Collaboration Control in Complex Environments with Adjustable Autonomy. IAT 2012: 146-153 - Bryan Cunningham, Yong Cao:
Non-reciprocating Sharing Methods in Cooperative Q-Learning Environments. IAT 2012: 212-219 - Esther David, Rina Azoulay:
No More Damaging Ads on Your Own Webpage - Strategy Proof Mechanisms for Ad Placement. IAT 2012: 140-145 - Esther David, Efrat Manisterski, Sarit Kraus, Nicholas R. Jennings:
Efficient Complex Tasks Allocation within Agents Environment of Known Capabilities. IAT 2012: 299-304 - Frank Dignum, Virginia Dignum, Catholijn M. Jonker:
Close Encounters of the Agent Kind: Designing Agents for Effective Training. IAT 2012: 251-257 - Yihua Ding, James Z. Wang, Pradip K. Srimani:
Churn Tolerance Algorithm for State Machine Replication. IAT 2012: 356-360 - Avshalom Elmalech, David Sarne:
Evaluating the Applicability of Peer-Designed Agents in Mechanisms Evaluation. IAT 2012: 374-381 - Leon Endhoven, Tomas Klos, Cees Witteveen:
Maximum Flexibility and Optimal Decoupling in Task Scheduling Problems. IAT 2012: 33-37 - Xiaocong Fan:
Decision as Choice of Potential Intentions. IAT 2012: 220-227 - Valentina Franzoni, Alfredo Milani:
PMING Distance: A Collaborative Semantic Proximity Measure. IAT 2012: 442-449 - Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng:
Lagrangian Relaxation for Large-Scale Multi-agent Planning. IAT 2012: 494-501 - Jianye Hao, Ho-fung Leung:
ABiNeS: An Adaptive Bilateral Negotiating Strategy over Multiple Items. IAT 2012: 95-102 - Christopher G. Harris:
Developing a Repeated Multi-agent Constant-Sum Game Algorithm Using Human Computation. IAT 2012: 390-394 - Badiâa Hedjazi, Mohamed Ahmed-Nacer, Samir Aknine, Karima Benatchba:
Initial Public Offering (IPO) Pricing Using a Multi-agent System. IAT 2012: 236-242 - Nicolas Höning, Han La Poutré:
Reduction of Market Power and Stabilisation of Outcomes in a Novel and Simplified Two-Settlement Electricity Market. IAT 2012: 103-110 - Jie Jiang, Virginia Dignum, Shengyu Wu, Yao-Hua Tan:
Agent-Based Modeling and Simulation of Multi-organizational Interactions in International Trade. IAT 2012: 90-94 - Jie Jiang, Bob Huisman, Virginia Dignum:
Agent-Based Multi-organizational Interaction Design: A Case Study of the Dutch Railway System. IAT 2012: 196-203 - Huan Jiang, Shigeo Matsubara:
Improving Crowdsourcing Efficiency Based on Division Strategy. IAT 2012: 425-429 - Janyl Jumadinova, Prithviraj Dasgupta, Leen-Kiat Soh:
Strategic Capability-Learning for Improved Multi-agent Collaboration in Ad-hoc Environments. IAT 2012: 287-292 - Robert Junges, Franziska Klügl:
Behavior Abstraction Robustness in Agent Modeling. IAT 2012: 228-235
skipping 44 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-07 11:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint