Sciweavers

5964 search results - page 1144 / 1193
» A theory of speculative computation
Sort
View
95
Voted
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 5 months ago
Complexity of determining nonemptiness of the core
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
95
Voted
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 5 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
WSNA
2003
ACM
15 years 5 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
124
Voted
AGTIVE
2003
Springer
15 years 5 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
111
Voted
ALS
2003
Springer
15 years 5 months ago
Not Everything We Know We Learned
This is foremost a methodological contribution. It focuses on the foundation of anticipation and the pertinent implications that anticipation has on learning (theory and experiment...
Mihai Nadin
« Prev « First page 1144 / 1193 Last » Next »