Sciweavers

2398 search results - page 294 / 480
» Constraint Programming and Graph Algorithms
Sort
View
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
16 years 29 days ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
ECAI
2000
Springer
15 years 10 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
154
Voted
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 8 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 7 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
CVPR
2011
IEEE
15 years 2 months ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik