Sciweavers

11565 search results - page 1962 / 2313
» Computing Minimal Mappings
Sort
View
AAAI
2007
15 years 9 months ago
Comprehending and Generating Apt Metaphors: A Web-driven, Case-based Approach to Figurative Language
Examples of figurative language can range from the explicit and the obvious to the implicit and downright enigmatic. Some simpler forms, like simile, often wear their meanings on...
Tony Veale, Yanfen Hao
AAAI
2008
15 years 9 months ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
FLAIRS
2008
15 years 9 months ago
A New Approach to Heuristic Estimations for Cost-Based Planning
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
USENIX
2007
15 years 9 months ago
Exploring Recovery from Operating System Lockups
Operating system lockup errors can render a computer unusable by preventing the execution other programs. Watchdog timers can be used to recover from a lockup by resetting the pro...
Francis M. David, Jeffrey C. Carlyle, Roy H. Campb...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
« Prev « First page 1962 / 2313 Last » Next »