Sciweavers

10493 search results - page 1664 / 2099
» Dynamic Word Problems
Sort
View
WWW
2009
ACM
16 years 4 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 4 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGMOD
2002
ACM
142views Database» more  SIGMOD 2002»
16 years 4 months ago
The Grid: An Application of the Semantic Web
The Grid is an emerging platform to support on-demand "virtual organisations" for coordinated resource sharing and problem solving on a global scale. The application thr...
Carole A. Goble, David De Roure
SDM
2009
SIAM
129views Data Mining» more  SDM 2009»
16 years 1 months ago
Scalable Distributed Change Detection from Astronomy Data Streams Using Local, Asynchronous Eigen Monitoring Algorithms.
This paper considers the problem of change detection using local distributed eigen monitoring algorithms for next generation of astronomy petascale data pipelines such as the Larg...
Kamalika Das, Kanishka Bhaduri, Sugandha Arora, We...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
16 years 21 days ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
« Prev « First page 1664 / 2099 Last » Next »