Sciweavers

135 search results - page 25 / 27
» Fixed-Point Definability and Polynomial Time
Sort
View
AI
2006
Springer
14 years 11 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
FUIN
2008
83views more  FUIN 2008»
14 years 11 months ago
Fault Diagnosis with Static and Dynamic Observers
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in t...
Franck Cassez, Stavros Tripakis
JACM
2000
73views more  JACM 2000»
14 years 11 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
SIAMDM
2010
194views more  SIAMDM 2010»
14 years 6 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
WWW
2009
ACM
16 years 12 days ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...