Sciweavers

1429 search results - page 119 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 9 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SECURWARE
2008
IEEE
14 years 3 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
RTSS
2003
IEEE
14 years 2 months ago
A Consensus Protocol for CAN-Based Systems
Consensus is known to be a fundamental problem in fault-tolerant distributed systems. Solving this problem provides the means for distributed processes to agree on a single value....
George M. de A. Lima, Alan Burns
GECCO
2009
Springer
14 years 3 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 9 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein