Sciweavers

849 search results - page 149 / 170
» The Early Restart Algorithm
Sort
View
JAIR
2000
123views more  JAIR 2000»
13 years 8 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
JHSN
2000
92views more  JHSN 2000»
13 years 8 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
AC
1998
Springer
13 years 8 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
COMCOM
2010
95views more  COMCOM 2010»
13 years 7 months ago
Trading link utilization for queueing delays: An adaptive approach
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...
Rade Stanojevic, Robert Shorten
MIDDLEWARE
2010
Springer
13 years 7 months ago
FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
Kyungbaek Kim, Sharad Mehrotra, Nalini Venkatasubr...