Sciweavers

2181 search results - page 34 / 437
» The restriction scaffold problem
Sort
View
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
14 years 2 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
EOR
2008
119views more  EOR 2008»
13 years 8 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn
CSL
2009
Springer
14 years 3 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
ADC
2009
Springer
136views Database» more  ADC 2009»
14 years 3 months ago
Solving the Golden Transaction Problem for ARIES-based Multi-level Recovery
Transaction throughput is a crucial issue for database systems. Multi-level transactions have been proposed in an attempt to offer improved concurrency of transaction processing ...
Jayson Speer, Markus Kirchberg, Faizal Riaz-ud-Din...
AAAI
1996
13 years 10 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker