Sciweavers

706 search results - page 56 / 142
» Super Solutions in Constraint Programming
Sort
View
CP
2005
Springer
15 years 5 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
ICRA
2010
IEEE
100views Robotics» more  ICRA 2010»
14 years 10 months ago
Weighted barrier functions for computation of force distributions with friction cone constraints
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
Per Henrik Borgstrom, Maxim A. Batalin, Gaurav S. ...
BMCBI
2011
14 years 3 months ago
A user-friendly web portal for T-Coffee on supercomputers
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
Josep Rius Torrento, Fernando Cores, Francesc Sols...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 5 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ICCV
2011
IEEE
13 years 12 months ago
Trajectory reconstruction from non-overlapping surveillance cameras with relative depth ordering constraints
We present a method for reconstructing a trajectory of an object moving in front of non-overlapping fully or partially calibrated cameras. The non-overlapping setup turns that pro...
Branislav Micusik