4507 search results - page 230 / 902 » Generalized Binet dynamics |
228
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
206
click to vote
DLS
2007
15 years 10 months ago
2007
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
161
click to vote
GROUP
2007
ACM
15 years 10 months ago
2007
ACM
Being aware of others' activities has played a vital role in the success of online collaboration. This resulted in the emergence of many groupware systems that provide users ...
188
click to vote
CODES
2001
IEEE
15 years 10 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
203
click to vote
PASTE
2010
ACM
15 years 10 months ago
2010
ACM
ROADRUNNER is a dynamic analysis framework designed to facilitate rapid prototyping and experimentation with dynamic analyses for concurrent Java programs. It provides a clean API...