Sciweavers

11814 search results - page 2202 / 2363
» On Generalization by Neural Networks
Sort
View
INFOCOM
2000
IEEE
15 years 8 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
WETICE
2000
IEEE
15 years 8 months ago
Reducing Software Security Risk through an Integrated Approach
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
David P. Gilliam, John C. Kelly, Matt Bishop
SIGUCCS
2000
ACM
15 years 8 months ago
Manage All the Computer Labs on Campus? What Did I Do to Deserve This?
This paper will discuss how the Information Services Client Services group facilitates the support of campus computer labs. It will discuss how one group consisting of three full-...
Kathy DuBose
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ICDCS
1999
IEEE
15 years 8 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
« Prev « First page 2202 / 2363 Last » Next »