21324 search results - page 377 / 4265 » Making the case for computing |
149
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
175
click to vote
STACS
1992
Springer
15 years 9 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
119
Voted
FPL
2005
Springer
15 years 10 months ago
2005
Springer
We present experimental evidence that multiple compute-units, compiled from sequential high-level language input programs, can be merged into a reduced number of configurations f...
131
Voted
AMAST
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. A general parametric analysis problem which allows the use of parameter variables in both the realtime automata and the specifications is proposed and solved. The analys...
158
click to vote
SP
2002
IEEE
15 years 4 months ago
2002
IEEE
provide a scalable and adaptable abstraction of the system architecture. Each agent is able to cooperate with other agents and thereby provide service advertisement and discovery f...