Sciweavers

7106 search results - page 1200 / 1422
» Restricted Complexity, General Complexity
Sort
View
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
15 years 10 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
15 years 10 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
DIS
2003
Springer
15 years 10 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 10 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
ICALP
2003
Springer
15 years 10 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
« Prev « First page 1200 / 1422 Last » Next »