Sciweavers

3946 search results - page 221 / 790
» The computational complexity of choice sets
Sort
View
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
16 years 1 months ago
Quantized average consensus via dynamic coding/decoding schemes
— In the average consensus a set of linear systems has to be driven to the same final state which corresponds to the average of their initial states. This contribution presents ...
Ruggero Carli, Francesco Bullo, Sandro Zampieri
ENGL
2008
170views more  ENGL 2008»
15 years 6 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
IROS
2009
IEEE
227views Robotics» more  IROS 2009»
16 years 1 months ago
Cell-RRT: Decomposing the environment for better plan
— In order to define an architecture for task and motion planning of a mobile robot, we propose the CellRRT path planner that combines the advantages of planning approaches by d...
Julien Guitton, Jean-Loup Farges, Raja Chatila
CIKM
2009
Springer
16 years 1 months ago
Pure spreading activation is pointless
Almost every application of spreading activation is accompanied by its own set of often heuristic restrictions on the dynamics. We show that in constraint-free scenarios spreading...
Michael R. Berthold, Ulrik Brandes, Tobias Kö...
IAT
2008
IEEE
16 years 1 months ago
Auction Analysis by Normal Form Game Approximation
Auctions are pervasive in today’s society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by int...
Michael Kaisers, Karl Tuyls, Frank Thuijsman, Simo...