Sciweavers

925 search results - page 79 / 185
» Connectivity on Complete Lattices
Sort
View
JCT
2007
85views more  JCT 2007»
15 years 6 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
ICLA
2011
Springer
14 years 9 months ago
A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
Ernst-Erich Doberkat
ICIW
2009
IEEE
16 years 25 days ago
An Architecture for Reliable Mobile Workflow in a Grid Environment
— Mobile peer to peer (P2P) computing is becoming a major revolution in computing owing to advances in computing power, network connectivity and storage capacity of mobile device...
Bill Karakostas, George Fakas
MST
2007
138views more  MST 2007»
15 years 5 months ago
Parameterized Complexity of Vertex Cover Variants
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ICPR
2006
IEEE
16 years 7 months ago
Geodesic Curves for Analysis of Continuous Implicit Shapes
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...
Jan Erik Solem