Sciweavers

1738 search results - page 149 / 348
» An algorithmic framework for network reconstruction
Sort
View
139
Voted
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
MP
1998
109views more  MP 1998»
15 years 4 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
145
Voted
TCAD
2002
73views more  TCAD 2002»
15 years 4 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
145
Voted
IWANN
2009
Springer
15 years 11 months ago
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
Karnig Derderian, Mercedes G. Merayo, Robert M. Hi...
TIP
2008
261views more  TIP 2008»
15 years 4 months ago
CTex - An Adaptive Unsupervised Segmentation Algorithm Based on Color-Texture Coherence
Abstract--This paper presents the development of an unsupervised image segmentation framework (referred to as CTex) that is based on the adaptive inclusion of color and texture in ...
Dana Elena Ilea, Paul F. Whelan