Sciweavers

6036 search results - page 19 / 1208
» Web search solved
Sort
View
QSHINE
2005
IEEE
14 years 3 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
CP
2005
Springer
14 years 3 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
EPIA
2001
Springer
14 years 2 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona
ECAI
2004
Springer
14 years 3 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
HM
2009
Springer
165views Optimization» more  HM 2009»
14 years 2 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl