462 search results - page 73 / 93 » Symbolic Bounded Synthesis |
118
click to vote
FSTTCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
164
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We present a Genetic Programming approach to evolve cooperative controllers for teams of UAVs. Our focus is a collaborative search mission in an uncertain and/or hostile environme...
103
click to vote
LCTRTS
2004
Springer
15 years 7 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
112
Voted
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— In this paper, adaptive control is presented for a class of parametric output feedback nonlinear systems with output constraint. Adaptive observer backstepping is adopted to ac...
121
Voted
CSJM
2006
15 years 1 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...