Sciweavers

6279 search results - page 1152 / 1256
» Studies in Solution Sampling
Sort
View
COMPGEOM
2008
ACM
14 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
DLS
2008
149views Languages» more  DLS 2008»
14 years 11 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ATMOS
2008
103views Optimization» more  ATMOS 2008»
14 years 11 months ago
IP-based Techniques for Delay Management with Priority Decisions
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
Michael Schachtebeck, Anita Schöbel
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
SPLC
2008
14 years 11 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
« Prev « First page 1152 / 1256 Last » Next »