Sciweavers

4432 search results - page 300 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
CPAIOR
2006
Springer
15 years 6 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
PIMRC
2008
IEEE
15 years 10 months ago
Radio resource allocation in OFDMA multihop cellular cooperative networks
Multihop cellular networks (MeNs) is an extension of single hop cellular networks (SCNs) having benefits of a fixed base station and flexible ad hoc networks. The radio resource ma...
Cheol Jeong, Hyung-Myung Kim
REX
1991
15 years 7 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
WLP
2004
Springer
15 years 9 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták
ICPR
2010
IEEE
15 years 9 months ago
Finding Multiple Object Instances with Occlusion
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
Ge Guo, Tingting Jiang, Yizhou Wang, Wen Gao