Sciweavers

627 search results - page 23 / 126
» Branched Polyhedral Systems
Sort
View
ATAL
2006
Springer
14 years 11 days ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
13 years 10 months ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...
IJCNN
2007
IEEE
14 years 2 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
ENTCS
2010
139views more  ENTCS 2010»
13 years 8 months ago
Spartacus: A Tableau Prover for Hybrid Logic
Spartacus is a tableau prover for hybrid multimodal logic with global modalities and reflexive and transitive relations. Spartacus is the first system to use pattern-based blocking...
Daniel Götzmann, Mark Kaminski, Gert Smolka
FOSSACS
2005
Springer
14 years 2 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste