Sciweavers

3229 search results - page 171 / 646
» The Theory of Timed Automata
Sort
View
JMLR
2006
105views more  JMLR 2006»
15 years 6 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
JSYML
2006
79views more  JSYML 2006»
15 years 6 months ago
Local-global properties of positive primitive formulas in the theory of spaces of orderings
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...
M. Marshall
JSYML
2002
66views more  JSYML 2002»
15 years 6 months ago
Open Questions in The Theory of Spaces of Orderings
f orderings provide an abstract framework in which to study spaces of orderings of formally real fields. Spaces of orderings of finite chain length are well understood [9] [12]. Th...
Murray A. Marshall
RAS
2008
86views more  RAS 2008»
15 years 6 months ago
Theory and implementation of path planning by negotiation for decentralized agents
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algo...
Oliver Purwin, Raffaello D'Andrea, Jin-Woo Lee
FOSSACS
2011
Springer
14 years 10 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...