Sciweavers

16596 search results - page 281 / 3320
» Generalized Assignment Problems
Sort
View
160
Voted
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
WLP
2004
Springer
16 years 2 days ago
A Pragmatic Approach to Pre-testing Prolog Programs
Abstract. We present an overview on the AT(x) approach which is capable of automatically analyzing programs with respect to given tests and a reference solution. In the context of ...
Christoph Beierle, Marija Kulas, Manfred Widera
INFOCOM
1995
IEEE
15 years 10 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
ESOP
2008
Springer
15 years 8 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
INFOCOM
2003
IEEE
16 years 22 hour ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi