Sciweavers

3433 search results - page 290 / 687
» Heuristics for a bidding problem
Sort
View
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 11 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
15 years 10 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...
FPGA
1995
ACM
105views FPGA» more  FPGA 1995»
15 years 10 months ago
On Nominal Delay Minimization in LUT-based FPGA Technology Mapping
We study the nominal delay minimization problem in LUTbased FPGA technologymapping, where interconnect delay is assumed proportionalto net fanout size. We prove that the delay-opt...
Jason Cong, Yuzheng Ding
JFPLC
2003
15 years 8 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao
EOR
2008
90views more  EOR 2008»
15 years 6 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...