Sciweavers

1450 search results - page 197 / 290
» On the Complexity of Hardness Amplification
Sort
View
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 3 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
SIGMETRICS
2006
ACM
174views Hardware» more  SIGMETRICS 2006»
14 years 3 months ago
Understanding the management of client perceived response time
Understanding and managing the response time of web services is of key importance as dependence on the World Wide Web continues to grow. We present Remote Latency-based Management...
David P. Olshefski, Jason Nieh
WISE
2005
Springer
14 years 3 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
HT
2005
ACM
14 years 3 months ago
Processing link structures and linkbases in the web's open world linking
Hyperlinks are an essential feature of the World Wide Web, highly responsible for its success. XLink improves on HTML’s linking capabilities in several ways. In particular, link...
François Bry, Michael Eckert
PLDI
2005
ACM
14 years 3 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...