Sciweavers

3082 search results - page 310 / 617
» New Bounds for the Controller Problem
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
CGF
2006
125views more  CGF 2006»
15 years 6 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
COMPGEOM
2004
ACM
16 years 4 days ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
VMCAI
2009
Springer
16 years 1 months ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari
HPCC
2007
Springer
16 years 26 days ago
Open Box Protocol (OBP)
In this paper we propose a new explicit congestion control approach, Open Box Protocol (OBP). The OBP gives sources the capacity to look inside the network and to make their conges...
Paulo Loureiro, Saverio Mascolo, Edmundo Monteiro