Sciweavers

489 search results - page 96 / 98
» Towards an Analysis of Local Optimization Algorithms
Sort
View
ICALP
2004
Springer
14 years 28 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
INFOCOM
2006
IEEE
14 years 1 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
CC
2006
Springer
124views System Software» more  CC 2006»
13 years 11 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
JMLR
2011
117views more  JMLR 2011»
13 years 2 months ago
Parameter Screening and Optimisation for ILP using Designed Experiments
Reports of experiments conducted with an Inductive Logic Programming system rarely describe how specific values of parameters of the system are arrived at when constructing model...
Ashwin Srinivasan, Ganesh Ramakrishnan