Sciweavers

882 search results - page 150 / 177
» Local Search for Very Large SAT Problems
Sort
View
129
Voted
DEXAW
2005
IEEE
121views Database» more  DEXAW 2005»
15 years 9 months ago
Resource Discovery in a Dynamic Grid Environment
Resource discovery in a Grid environment is a critical problem, as a typical Grid system includes a very large number of resources, which must be readily identified and accessed ...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...
127
Voted
ICDCSW
2005
IEEE
15 years 9 months ago
On Optimal TTL Sequence-Based Route Discovery in MANETs
In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flood...
Dimitrios Koutsonikolas, Saumitra M. Das, Himabind...
112
Voted
SPAA
2003
ACM
15 years 9 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
161
Voted
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 8 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
112
Voted
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 7 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...