Sciweavers

1679 search results - page 78 / 336
» Strong order equivalence
Sort
View
CPC
2010
74views more  CPC 2010»
13 years 7 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
FOSSACS
2011
Springer
13 years 1 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
APWEB
2007
Springer
14 years 4 months ago
Untyped XQuery Canonization
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community an...
Nicolas Travers, Tuyet-Tram Dang-Ngoc, Tianxiao Li...
FORTE
1990
13 years 11 months ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier
ICRA
2003
IEEE
272views Robotics» more  ICRA 2003»
14 years 3 months ago
Calculating possible local displacement of curve objects using improved screw theory
— Various methods to recognize assembly tasks using possible local displacement of objects have been proposed. To calculate this displacement, the screw theory is employed. It is...
Jun Takamatsu, Koichi Ogawara, Hiroshi Kimura, Kat...