Sciweavers

13987 search results - page 412 / 2798
» The Two Guards Problem
Sort
View
LPNMR
2009
Springer
15 years 11 months ago
Computing Weighted Solutions in Answer Set Programming
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
Duygu Çakmak, Esra Erdem, Halit Erdogan
STACS
2009
Springer
15 years 11 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
Nicole Schweikardt
IMA
2001
Springer
90views Cryptology» more  IMA 2001»
15 years 11 months ago
Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation
This paper investigates interoperability problems arising from the use of dissimilar key recovery mechanisms in encrypted communications. The components that can cause interoperabi...
Konstantinos Rantos, Chris J. Mitchell
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
15 years 11 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
IPPS
1997
IEEE
15 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu