Sciweavers

510 search results - page 28 / 102
» How Should We Solve Search Problems Privately
Sort
View
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 7 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
PG
1999
IEEE
13 years 11 months ago
Reconstruction and Simplification of Surfaces from Contours
In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem has to decide which contours of two successive s...
Reinhard Klein, Andreas Schilling, Wolfgang Stra&s...
ATAL
2009
Springer
14 years 2 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...
IJCAI
1997
13 years 8 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
IJCAI
2007
13 years 9 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...