824 search results - page 136 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
113
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
125
click to vote
TPHOL
2005
IEEE
15 years 7 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
113
click to vote
JPDC
2008
15 years 1 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
107
click to vote
HYBRID
1994
Springer
15 years 6 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
134
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...