Sciweavers

706 search results - page 50 / 142
» Super Solutions in Constraint Programming
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 5 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
DAC
2007
ACM
16 years 24 days ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
ICIP
2001
IEEE
16 years 1 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
ICCAD
2009
IEEE
198views Hardware» more  ICCAD 2009»
14 years 9 months ago
Battery allocation for wireless sensor network lifetime maximization under cost constraints
Wireless sensor networks hold the potential to open new domains to distributed data acquisition. However, such networks are prone to premature failure because some nodes deplete t...
Hengyu Long, Yongpan Liu, Yiqun Wang, Robert P. Di...
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 12 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri