Sciweavers

877 search results - page 75 / 176
» How to Cover a Grammar
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 4 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
117
Voted
USS
2010
14 years 10 months ago
Chipping Away at Censorship Firewalls with User-Generated Content
Oppressive regimes and even democratic governments restrict Internet access. Existing anti-censorship systems often require users to connect through proxies, but these systems are...
Sam Burnett, Nick Feamster, Santosh Vempala
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 6 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
82
Voted
GECCO
2003
Springer
15 years 5 months ago
Structural Emergence with Order Independent Representations
Abstract. This paper compares two grammar based Evolutionary Automatic Programming methods, Grammatical Evolution (GE) and Chorus. Both systems evolve sequences of derivation rules...
R. Muhammad Atif Azad, Conor Ryan
92
Voted
ICAIL
1997
ACM
15 years 4 months ago
Automated Drafting of Self-Explaining Documents
The capacity for self-explanation can makecomputer-drafted documents more credible, assist in the retrieval and adaptation of archival documents, and permit comparison of document...
Karl Branting, James C. Lester, Charles B. Callawa...