Sciweavers

2905 search results - page 390 / 581
» Formal Memetic Algorithms
Sort
View
SAT
2004
Springer
97views Hardware» more  SAT 2004»
15 years 9 months ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 9 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
ICCV
2003
IEEE
15 years 9 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
KCAP
2003
ACM
15 years 9 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 9 months ago
Extracting Structured Data from Web Pages
Many web sites contain large sets of pages generated using a common template or layout. For example, Amazon lays out the author, title, comments, etc. in the same way in all its b...
Arvind Arasu, Hector Garcia-Molina