Sciweavers

12950 search results - page 135 / 2590
» On Optimal Timed Strategies
Sort
View
CEC
2007
IEEE
15 years 10 months ago
Evolving the best-response strategy to decide when to make a proposal
— This paper designed and developed negotiation agents with the distinguishing features of 1) conducting continuous time negotiation rather than discrete time negotiation, 2) lea...
Bo An, Kwang Mong Sim, Victor R. Lesser
RTAS
2009
IEEE
15 years 10 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
WWW
2009
ACM
16 years 4 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 8 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
IPPS
2000
IEEE
15 years 8 months ago
Information Exchange in Multi Colony Ant Algorithms
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
Martin Middendorf, Frank Reischle, Hartmut Schmeck