Sciweavers

243 search results - page 20 / 49
» How to Solve It Automatically: Selection Among Problem Solvi...
Sort
View
EDOC
2002
IEEE
14 years 15 days ago
Constraint Based Network Adaptation for Ubiquitous Applications
In this paper, we present a constraint-based approach for selecting and deploying active network components, called proxylets, which execute on servers within the network to perfo...
Krish T. Krishnakumar, Morris Sloman
TON
2010
162views more  TON 2010»
13 years 2 months ago
Fast Algorithms for Resource Allocation in Wireless Cellular Networks
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
Ritesh Madan, Stephen P. Boyd, Sanjay Lall
CADE
2007
Springer
14 years 1 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
LREC
2010
176views Education» more  LREC 2010»
13 years 9 months ago
There's no Data like More Data? Revisiting the Impact of Data Size on a Classification Task
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
Ines Rehbein, Josef Ruppenhofer
AAAI
2007
13 years 10 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...