Sciweavers

4679 search results - page 547 / 936
» Modeling When Connections Are the Problem
Sort
View
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 7 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 6 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
CACM
2006
95views more  CACM 2006»
15 years 6 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
CJ
2006
100views more  CJ 2006»
15 years 6 months ago
Deterministic Identity-Based Signatures for Partial Aggregation
Aggregate signatures are a useful primitive which allows to aggregate into a single and constant-length signature many signatures on different messages computed by different users...
Javier Herranz
CPC
2000
93views more  CPC 2000»
15 years 6 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount