1686 search results - page 202 / 338 » Programs as polygraphs: computability and complexity |
138
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
150
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
126
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
160
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
135
click to vote
CLUSTER
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...