2542 search results - page 58 / 509 » One step ahead |
154
click to vote
RE
2006
Springer
15 years 6 months ago
2006
Springer
A technique is presented for obtaining a specification from a requirement through a series of incremental steps. The starting point is a Problem Frame description involving a requ...
142
click to vote
SIGCSE
2000
ACM
15 years 10 months ago
2000
ACM
The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic p...
150
click to vote
ISMIS
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
197
click to vote
VVS
1995
IEEE
15 years 9 months ago
1995
IEEE
Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition...
130
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...