Sciweavers

18306 search results - page 294 / 3662
» Algorithmics in Exponential Time
Sort
View
GI
2009
Springer
15 years 4 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf
ICML
2007
IEEE
16 years 7 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 1 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
ISTCS
1993
Springer
15 years 10 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek
AAIP
2009
15 years 7 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson