Sciweavers

257 search results - page 39 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
62
Voted
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 2 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
VLDB
1987
ACM
108views Database» more  VLDB 1987»
15 years 1 months ago
Translating and Optimizing SQL Queries Having Aggregates
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
Günter von Bültzingsloewen
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
Jacques M. Bahi, Raphaël Couturier
KBSE
2002
IEEE
15 years 2 months ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta
ATAL
2006
Springer
15 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara