Sciweavers

6693 search results - page 22 / 1339
» On an anytime algorithm for control
Sort
View
ATC
2006
Springer
15 years 1 months ago
Ubisafe Computing: Vision and Challenges (I)
In recent years, a variety of new computing paradigms have been proposed for various purposes. It is true that many of them intend to and really can gratify some of the people some...
Jianhua Ma, Qiangfu Zhao, Vipin Chaudhary, Jingde ...
93
Voted
CPAIOR
2008
Springer
14 years 11 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
93
Voted
CSCLP
2007
Springer
15 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
DCOSS
2005
Springer
15 years 3 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff
AAAI
2000
14 years 11 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri