AUTOMATICA
2006
13 years 4 months ago
2006
Motivated by questions in stability theory for hybrid dynamical systems, we establish some fundamental properties of the set of solutions to such systems. Using the notion of a hy...
APPML
2006
13 years 4 months ago
2006
For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-u...
ENTCS
2008
13 years 4 months ago
2008
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
ENTCS
2008
13 years 4 months ago
2008
A lot of progress has been made to secure network communication, e.g., through the use of cryptographic algorithms. However, this offers only a partial solution as long as the com...
ENDM
2008
13 years 4 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
AIR
2006
13 years 4 months ago
2006
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
AI
2006
Springer
13 years 4 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
DEDS
2008
13 years 4 months ago
2008
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...