Sciweavers

9842 search results - page 231 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
MOBICOM
2006
ACM
14 years 4 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
DAGSTUHL
2003
14 years 5 days ago
The Autotelic Principle
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
Luc Steels
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 4 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
RECOMB
2008
Springer
14 years 11 months ago
A Bayesian Approach to Protein Inference Problem in Shotgun Proteomics
The protein inference problem represents a major challenge in shotgun proteomics. Here we describe a novel Bayesian approach to address this challenge that incorporates the predict...
Yong Fuga Li, Randy J. Arnold, Yixue Li, Predrag R...
ICSE
2004
IEEE-ACM
14 years 11 months ago
Problem Structure and Dependable Architecture
An approach to software development is sketched in which problem structuring is separated from software architecture. The problem is decomposed into subproblems of familiar classes...
Michael Jackson