4940 search results - page 354 / 988 » On the Complexity of Universal Programs |
211
click to vote
FPL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present a rapid prototyping platform on a single Field Programmable Gate Array (FPGA) with support for software transactional memory. The system is composed only b...
205
click to vote
SIGSOFT
2003
ACM
15 years 12 months ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
141
Voted
KES
1998
Springer
15 years 11 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
153
click to vote
CP
2005
Springer
16 years 7 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...