Sciweavers

2266 search results - page 380 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
NIPS
2008
15 years 5 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 4 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 4 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
IJCSA
2007
130views more  IJCSA 2007»
15 years 4 months ago
Binary Particle Swarm Optimization Based Defensive Islanding Of Large Scale Power Systems
Power system defensive islanding is an efficient way to avoid catastrophic wide area blackouts, such as the 2003 North American Blackout. Finding defensive islands of large-scale ...
Wenxin Liu, Li Liu, David A. Cartes, Ganesh K. Ven...
TON
2008
135views more  TON 2008»
15 years 4 months ago
Measurement-based admission control at edge routers
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
Seung Yeob Nam, Sunggon Kim, Dan Keun Sung