Sciweavers

1650 search results - page 143 / 330
» The HOM problem is decidable
Sort
View
ITNG
2008
IEEE
15 years 10 months ago
Overlapped Layers for Prolonging Network Lifetime in Multi-Hop Wireless Sensor Networks
In this paper, the bottleneck problem in PRMC-based wireless sensor networks is studied. This problem can be solved by overlapping neighboring layers. By this way, more cluster he...
Hongyan Wang, Mei Yang, Yingtao Jiang, Shupeng Wan...
LICS
2008
IEEE
15 years 10 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...
AIMSA
2008
Springer
15 years 10 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
IAT
2007
IEEE
15 years 10 months ago
Analysis of Multi-Actor Policy Contexts Using Perception Graphs
Policy making is a multi-actor process: it involves a variety of actors, each trying to further their own interests. How these actors decide and act largely depends on the way the...
Pieter W. G. Bots
115
Voted
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
15 years 10 months ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...