Sciweavers

4117 search results - page 158 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 10 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
ORL
2002
92views more  ORL 2002»
15 years 6 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
ICRA
2010
IEEE
114views Robotics» more  ICRA 2010»
15 years 5 months ago
Navigating multiple simple-airplanes in 3D workspace
Abstract— We present an algorithm for collision-free navigation of multiple flying robots in three-dimensional workspace. Our approach extends the model of a simple car to a sim...
Jamie Snape, Dinesh Manocha
PVLDB
2010
151views more  PVLDB 2010»
15 years 4 months ago
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux
We present Data Auditor, a tool for exploring data quality and data semantics. Given a rule or an integrity constraint and a target relation, Data Auditor computes pattern tableau...
Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh...
ICRA
2009
IEEE
108views Robotics» more  ICRA 2009»
15 years 4 months ago
On the generation of feasible paths for aerial robots with limited climb angle
This paper presents a methodology based on a variation of the Quintic Pythagorean Hodographs curves for generating smooth feasible paths for autonomous vehicles in three-dimensiona...
Armando Alves Neto, Mario Fernando Montenegro Camp...