Sciweavers

11949 search results - page 2330 / 2390
» Some results on (a:b)-choosability
Sort
View
JACM
2000
77views more  JACM 2000»
15 years 1 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
JAIR
2000
96views more  JAIR 2000»
15 years 1 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
JASIS
2000
143views more  JASIS 2000»
15 years 1 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
JCNS
2000
165views more  JCNS 2000»
15 years 1 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
JHSN
2000
92views more  JHSN 2000»
15 years 1 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
« Prev « First page 2330 / 2390 Last » Next »