1603 search results - page 65 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
165
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
140
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
162
click to vote
EVOW
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
272
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
175
click to vote
SIAMDM
2010
15 years 28 days ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...