Sciweavers

9325 search results - page 370 / 1865
» The decentralized implementability problem
Sort
View
ISAAC
2007
Springer
122views Algorithms» more  ISAAC 2007»
15 years 11 months ago
Compressing Spatio-temporal Trajectories
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
Joachim Gudmundsson, Jyrki Katajainen, Damian Merr...
DATE
2005
IEEE
116views Hardware» more  DATE 2005»
15 years 10 months ago
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition
This paper addresses two problems related to disjointsupport decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results...
Andrés Martinelli, Elena Dubrova
ATAL
2005
Springer
15 years 10 months ago
A drosophila for computational dialectics
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of c...
Simon Wells, Chris Reed
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 10 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
145
Voted
EVOW
2004
Springer
15 years 10 months ago
Evolutionary Design Space Exploration for Median Circuits
This paper shows that it is possible to (1) discover novel implementations of median circuits using evolutionary techniques and (2) find out suitable median circuits in case that ...
Lukás Sekanina