Sciweavers

4934 search results - page 613 / 987
» complexity 2008
Sort
View
TIT
2008
65views more  TIT 2008»
15 years 6 months ago
Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...
Xin Wang, Georgios B. Giannakis
JAIR
2007
95views more  JAIR 2007»
15 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
JAIR
2007
146views more  JAIR 2007»
15 years 6 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
JALC
2007
109views more  JALC 2007»
15 years 6 months ago
A Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
JANCL
2007
115views more  JANCL 2007»
15 years 6 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...