1158 search results - page 90 / 232 » Software is discrete mathematics |
HYBRID
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
ESA
1994
Springer
14 years 2 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Using discrete Hidden-Markov-Models (HMMs) for recognition requires the quantization of the continuous feature vectors. In handwritten whiteboard note recognition it turns out tha...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...