Sciweavers

1568 search results - page 78 / 314
» The problem of examination questions in algorithmics
Sort
View
RECOMB
1997
Springer
15 years 8 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
IDA
2003
Springer
15 years 9 months ago
Clustering Mobile Trajectories for Resource Allocation in Mobile Environments
The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arise...
Dimitrios Katsaros, Alexandros Nanopoulos, Murat K...
TARK
2007
Springer
15 years 10 months ago
Dealing with logical omniscience
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
Joseph Y. Halpern, Riccardo Pucella
148
Voted
SENSYS
2003
ACM
15 years 9 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
EPS
1998
Springer
15 years 8 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf