Sciweavers

633 search results - page 98 / 127
» Locality and Hard SAT-Instances
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
C3S2E
2009
ACM
14 years 4 months ago
CPU, SMP and GPU implementations of Nohalo level 1, a fast co-convex antialiasing image resampler
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
Nicolas Robidoux, Minglun Gong, John Cupitt, Adam ...
SACMAT
2009
ACM
14 years 4 months ago
Analysis of virtual machine system policies
The recent emergence of mandatory access (MAC) enforcement for virtual machine monitors (VMMs) presents an opportunity to enforce a security goal over all its virtual machines (VM...
Sandra Rueda, Hayawardh Vijayakumar, Trent Jaeger
SIGCOMM
2009
ACM
14 years 4 months ago
A programmable, generic forwarding element approach for dynamic network functionality
Communication networks are growing exponentially, and new services and applications are being introduced unceasingly. To meet the demands of these services and applications, curre...
Ran Giladi, Niv Yemini
SIGCOMM
2009
ACM
14 years 4 months ago
Router primitives for programmable active measurement
Active probe-based measurements are the foundation for understanding important network path properties such as SLA compliance and available bandwidth. Well-known challenges in act...
Joel Sommers, Paul Barford, Mark Crovella