Sciweavers

16404 search results - page 382 / 3281
» A set coverage problem
Sort
View
CASES
2010
ACM
15 years 4 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
JBI
2011
233views Bioinformatics» more  JBI 2011»
15 years 1 months ago
A set of ontologies to drive tools for the control of vector-borne diseases
We are developing a set of ontologies that deal with vector-borne diseases and the arthropod vectors that transmit them. For practical reasons (application priorities), we initiat...
Pantelis Topalis, Emmanuel Dialynas, Elvira Mitrak...
COR
2004
139views more  COR 2004»
15 years 6 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland
CIE
2007
Springer
16 years 9 days ago
Post's Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
Joel David Hamkins, Russell G. Miller
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
16 years 7 days ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao