Sciweavers

9604 search results - page 1845 / 1921
» The Duality of TIme and Information
Sort
View
WSC
2007
15 years 8 months ago
New greedy myopic and existing asymptotic sequential selection procedures: preliminary empirical results
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
Stephen E. Chick, Jürgen Branke, Christian Sc...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 8 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
APLAS
2008
ACM
15 years 8 months ago
Abstraction of Clocks in Synchronous Data-Flow Systems
ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Pari...
Albert Cohen, Louis Mandel, Florence Plateau, Marc...
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ATAL
2008
Springer
15 years 8 months ago
Content-oriented composite service negotiation with complex preferences
In e-commerce, for some cases the service requested by the consumer cannot be fulfilled by the producer. In such cases, service consumers and producers need to negotiate their ser...
Reyhan Aydogan
« Prev « First page 1845 / 1921 Last » Next »