Sciweavers

4342 search results - page 504 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 11 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
WECWIS
2005
IEEE
121views ECommerce» more  WECWIS 2005»
16 years 12 days ago
Matching Composed Semantic Web Services at Publishing Time
This paper describes an algorithm optimizing the discovery process for composed semantic web services. The algorithm can be used to improve discovery of appropriate component servi...
Andreas Friesen, Michael Altenhofen
DAWAK
2005
Springer
16 years 10 days ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
GECCO
2005
Springer
16 years 10 days ago
Interactive estimation of agent-based financial markets models: modularity and learning
Building upon the interactive inversion method introduced by Ashburn and Bonabeau (2004), we show how to dramatically improve the results by exploiting modularity and by letting t...
M. Ihsan Ecemis, Eric Bonabeau, Trent Ashburn
WEBI
2005
Springer
16 years 9 days ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal