Sciweavers

2569 search results - page 395 / 514
» Approximate Objects and Approximate Theories
Sort
View
CEAS
2005
Springer
15 years 12 months ago
Experiences with Greylisting
Greylisting temporarily rejects mail from unknown sources on the theory that real mailers will retry while spamware won’t. I outline a taxonomy of greylisters and report some st...
John R. Levine
JACM
2007
160views more  JACM 2007»
15 years 6 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
SIAMCOMP
2011
15 years 1 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
ECCC
2007
147views more  ECCC 2007»
15 years 6 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
COR
2010
121views more  COR 2010»
15 years 6 months ago
A multi-objective approach for robust airline scheduling
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
Edmund K. Burke, Patrick De Causmaecker, Geert De ...