Sciweavers

1450 search results - page 91 / 290
» On the Complexity of Hardness Amplification
Sort
View
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
14 years 1 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
WWW
2005
ACM
14 years 9 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
ICFP
2009
ACM
14 years 9 months ago
Runtime support for multicore Haskell
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
Simon Marlow, Simon L. Peyton Jones, Satnam Singh
PODS
2004
ACM
98views Database» more  PODS 2004»
14 years 9 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
ICSE
2003
IEEE-ACM
14 years 9 months ago
DADO: Enhancing Middleware to Support Crosscutting Features in Distributed, Heterogeneous Systems
Some "non-' or "extra-functional" features, such as reliability, security, and tracing, defy modularization mechanisms in programming languages. This makes suc...
Eric Wohlstadter, Stoney Jackson, Premkumar T. Dev...