Sciweavers

7930 search results - page 582 / 1586
» Greedy in Approximation Algorithms
Sort
View
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
16 years 1 months ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
IPPS
2006
IEEE
16 years 1 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
16 years 22 days ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ICDT
1999
ACM
97views Database» more  ICDT 1999»
15 years 11 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 11 months ago
On Index Selection Schemes for Nested Object Hierarchies
In this paper we address the problem of devising a set of indexes for a nested object hierarchy in an object-oriented database to improve the overall system performance. It is not...
Sudarshan S. Chawathe, Ming-Syan Chen, Philip S. Y...