1139 search results - page 119 / 228 » Bounded Ideation Theory |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...