Sciweavers

9842 search results - page 1622 / 1969
» Problem complexity
Sort
View
ATAL
2003
Springer
16 years 1 days ago
How to calm hyperactive agents
System performance in multi-agent resource allocation systems can often improve if individual agents reduce their activity. Agents in such systems need a way to modulate their ind...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...
ATAL
2003
Springer
16 years 23 hour ago
A principled study of the design tradeoffs for autonomous trading agents
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
Ioannis A. Vetsikas, Bart Selman
184
Voted
BIRTHDAY
2003
Springer
16 years 23 hour ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
16 years 21 hour ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
16 years 20 hour ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
« Prev « First page 1622 / 1969 Last » Next »