Sciweavers

7930 search results - page 1158 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICCBR
2003
Springer
16 years 16 hour ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel
DATE
2002
IEEE
104views Hardware» more  DATE 2002»
15 years 11 months ago
Closed-Form Crosstalk Noise Metrics for Physical Design Applications
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
Lauren Hui Chen, Malgorzata Marek-Sadowska
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 11 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ICDCN
2009
Springer
15 years 11 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
« Prev « First page 1158 / 1586 Last » Next »