Sciweavers

602 search results - page 118 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
CP
2000
Springer
14 years 2 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 6 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 11 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
EUROSYS
2006
ACM
14 years 6 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
EVOW
2010
Springer
14 years 1 months ago
Towards Automated Learning of Object Detectors
Recognizing arbitrary objects in images or video sequences is a difficult task for a computer vision system. We work towards automated learning of object detectors from video seque...
Marc Ebner