Sciweavers

1092 search results - page 108 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
COCOON
1999
Springer
15 years 10 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
CNSR
2007
IEEE
336views Communications» more  CNSR 2007»
15 years 10 months ago
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
Md. Ashiqur Rahman, Sajid Hussain
CSR
2006
Springer
15 years 9 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
CSL
2010
Springer
15 years 7 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
133
Voted
FSTTCS
2008
Springer
15 years 7 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn