Sciweavers

218 search results - page 20 / 44
» Improved Low-Degree Testing and its Applications
Sort
View
EPS
1998
Springer
15 years 4 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
CP
2006
Springer
15 years 3 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
EMNLP
2010
14 years 9 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
ALGORITHMICA
2011
14 years 6 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
14 years 2 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...