Sciweavers

336 search results - page 33 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
AAAI
2008
13 years 10 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
IWQOS
2004
Springer
14 years 27 days ago
Topology design for service overlay networks with bandwidth guarantees
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traf...
S. L. Vieira, Jörg Liebeherr
JCB
2007
146views more  JCB 2007»
13 years 7 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
SAT
2005
Springer
104views Hardware» more  SAT 2005»
14 years 1 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren