Sciweavers

2905 search results - page 469 / 581
» Formal Memetic Algorithms
Sort
View
RECOMB
1998
Springer
14 years 2 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
PDIS
1996
IEEE
14 years 2 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
14 years 2 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
ICSE
1993
IEEE-ACM
14 years 2 months ago
"...And Nothing Else Changes": The Frame Problem in Procedure Specifications
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
Alexander Borgida, John Mylopoulos, Raymond Reiter
ICALP
1994
Springer
14 years 2 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige