Sciweavers

944 search results - page 47 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 3 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
JCO
2007
123views more  JCO 2007»
14 years 11 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
AAAI
2000
15 years 1 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
Sakib A. Mondal, Anup K. Sen
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
15 years 8 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
SAC
2009
ACM
15 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi