Sciweavers

1480 search results - page 150 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
A new mirror-based extrinsic camera calibration using an orthogonality constraint
This paper is aimed at calibrating the relative posture and position, i.e. extrinsic parameters, of a stationary camera against a 3D reference object which is not directly visible...
Kosuke Takahashi, Shohei Nobuhara, Takashi Matsuya...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
CP
2006
Springer
15 years 10 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
CP
2005
Springer
16 years 1 days ago
Symmetry and Consistency
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Ro...
ECAI
2004
Springer
15 years 12 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano