Sciweavers

4266 search results - page 494 / 854
» The container loading problem
Sort
View
LICS
1994
IEEE
15 years 9 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
127
Voted
RTA
2010
Springer
15 years 8 months ago
Termination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 7 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
157
Voted
MCU
2007
113views Hardware» more  MCU 2007»
15 years 6 months ago
On the Computational Capabilities of Several Models
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
Olivier Bournez, Emmanuel Hainry
AI
2010
Springer
15 years 5 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina