Sciweavers

1463 search results - page 241 / 293
» Adaptive Focused Crawling
Sort
View
ICTAI
2009
IEEE
13 years 6 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
DEBU
2010
113views more  DEBU 2010»
13 years 6 months ago
Storage Class Memory Aware Data Management
Storage Class Memory (SCM) is here to stay. It has characteristics that place it in a class apart both from main memory and hard disk drives. Software and systems, architectures a...
Bishwaranjan Bhattacharjee, Mustafa Canim, Christi...
ENDM
2010
167views more  ENDM 2010»
13 years 6 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...
CVPR
2011
IEEE
13 years 4 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
CCIA
2010
Springer
13 years 3 months ago
Comparison of Topologies in Peer-to-Peer Data Sharing Networks
Interactions within Multi-agent systems can be structured in different ways depending on the application scenario and its environmental restrictions. In previous work we have devel...
Jordi Campos Miralles, Nuria Piqué, Maite L...