Sciweavers

103 search results - page 17 / 21
» The Cover Time of Random Digraphs
Sort
View
WWW
2004
ACM
14 years 8 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
ICCAD
2002
IEEE
143views Hardware» more  ICCAD 2002»
14 years 4 months ago
A Markov chain sequence generator for power macromodeling
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
Xun Liu, Marios C. Papaefthymiou
ICST
2008
IEEE
14 years 2 months ago
Prioritizing User-Session-Based Test Cases for Web Applications Testing
Web applications have rapidly become a critical part of business for many organizations. However, increased usage of web applications has not been reciprocated with corresponding ...
Sreedevi Sampath, Renée C. Bryce, Gokulanan...
WEBI
2004
Springer
14 years 1 months ago
Type-Based Composition of Information Services in Large Scale Environments
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
COLT
2003
Springer
14 years 29 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan