Sciweavers

3433 search results - page 433 / 687
» Heuristics for a bidding problem
Sort
View
ICDM
2003
IEEE
143views Data Mining» more  ICDM 2003»
16 years 23 hour ago
Active Sampling for Feature Selection
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...
Sriharsha Veeramachaneni, Paolo Avesani
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
16 years 20 hour ago
On addressing the run-cost variance in randomized motion planners
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
Pekka Isto, Martti Mäntylä, Juha O. Tuom...
INFOCOM
2003
IEEE
16 years 18 hour ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das
ICAIL
2003
ACM
15 years 12 months ago
Induction of Defeasible Logic Theories in the Legal Domain
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
Benjamin Johnston, Guido Governatori
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 12 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers