Sciweavers

4110 search results - page 435 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 11 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
ICC
2007
IEEE
168views Communications» more  ICC 2007»
15 years 10 months ago
Analysis and Optimization of Power Control in Multiuser Cognitive Wireless Networks
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
Peng Cheng, Guanding Yu, Zhaoyang Zhang, Peiliang ...
FLAIRS
2008
15 years 9 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
CCCG
2004
15 years 8 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
IJCAI
2001
15 years 8 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen