Sciweavers

1968 search results - page 206 / 394
» The Complexity of Valued Constraint Models
Sort
View
181
Voted
TON
2002
144views more  TON 2002»
15 years 5 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
ICCV
2011
IEEE
14 years 5 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
LISA
2007
15 years 7 months ago
PoDIM: A Language for High-Level Configuration Management
The high rate of requirement changes make system administration a complex task. This complexity is further influenced by the increasing scale, unpredictable behaviour of software ...
Thomas Delaet, Wouter Joosen
124
Voted
AAAI
2008
15 years 7 months ago
Potential-based Shaping in Model-based Reinforcement Learning
Potential-based shaping was designed as a way of introducing background knowledge into model-free reinforcement-learning algorithms. By identifying states that are likely to have ...
John Asmuth, Michael L. Littman, Robert Zinkov
UM
2009
Springer
15 years 10 months ago
History Dependent Recommender Systems Based on Partial Matching
Abstract. This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models rel...
Armelle Brun, Geoffray Bonnin, Anne Boyer