Sciweavers

1960 search results - page 199 / 392
» The Logic of Large Enough
Sort
View
AAAI
2004
13 years 11 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
AAAI
2004
13 years 11 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
AAAI
2006
13 years 11 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
FMOODS
2006
13 years 11 months ago
Generating Instance Models from Meta Models
Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the...
Karsten Ehrig, Jochen Malte Küster, Gabriele ...
SIROCCO
2004
13 years 11 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin