Sciweavers

475 search results - page 65 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Correspondence Establishment in Statistical Modeling of Shapes with Arbitrary Topology
Correspondence establishment is a key step in statistical shape model building. There are several automated methods for solving this problem in 3D, but they usually can only handl...
Ekaterina Syrkina, Gábor Székely, Mi...
ECAI
2008
Springer
13 years 9 months ago
A New Approach to Planning in Networks
Control of networks like those for transportation, power distribution, communication to name a few, provides challenges to planning and scheduling. Many problems can be defined in ...
Jussi Rintanen
IJCAI
2007
13 years 9 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
EUROPAR
2005
Springer
14 years 1 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
TPDS
2002
112views more  TPDS 2002»
13 years 7 months ago
Performance Analysis of a Distributed Question/Answering System
The problem of question/answering (Q/A) is to find answers to open-domain questions by searching large collections of documents. Unlike information retrieval systems, very common ...
Mihai Surdeanu, Dan I. Moldovan, Sanda M. Harabagi...