12519 search results - page 45 / 2504 » Approximation Problems Categories |
116
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
138
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
133
Voted
ENTCS
2006
15 years 2 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
112
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
156
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...