Sciweavers

2801 search results - page 264 / 561
» On the Adequateness of the Connection Method
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
16 years 5 days ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
FMCO
2005
Springer
16 years 5 days ago
A Software Component Model and Its Preliminary Formalisation
A software component model should define what components are, and how they can be composed. That is, it should define a theory of components and their composition. Current softwa...
Kung-Kiu Lau, Mario Ornaghi, Zheng Wang
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
16 years 4 days ago
The MaxSolve algorithm for coevolution
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...
Edwin D. de Jong
DEXA
2004
Springer
140views Database» more  DEXA 2004»
16 years 1 days ago
Declustering of Trajectories for Indexing of Moving Objects Databases
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
Youngduk Seo, Bonghee Hong
ICCSA
2004
Springer
16 years 11 hour ago
A Cluster Based Hierarchical Routing Protocol for Mobile Networks
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Kayhan Erciyes, Geoffrey Marshall