Sciweavers

1920 search results - page 78 / 384
» The Complexity of the A B C Problem
Sort
View
CPC
2000
93views more  CPC 2000»
15 years 6 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
IPPS
2003
IEEE
15 years 11 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
195
Voted
PROPERTYTESTING
2010
15 years 4 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
MOBIHOC
2009
ACM
16 years 6 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
MOBIHOC
2008
ACM
16 years 5 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang