Sciweavers

1224 search results - page 241 / 245
» Theory decision by decomposition
Sort
View
KI
2006
Springer
13 years 10 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
IJISEC
2007
119views more  IJISEC 2007»
13 years 10 months ago
An incentive compatible reputation mechanism for ubiquitous computing environments
The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user ...
Jinshan Liu, Valérie Issarny
IOR
2007
89views more  IOR 2007»
13 years 10 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
AIR
2004
113views more  AIR 2004»
13 years 10 months ago
Class Noise vs. Attribute Noise: A Quantitative Study
Real-world data is never perfect and can often suffer from corruptions (noise) that may impact interpretations of the data, models created from the data and decisions made based on...
Xingquan Zhu, Xindong Wu
AAMAS
2002
Springer
13 years 10 months ago
Adapting Populations of Agents
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...
Philippe De Wilde, Maria Chli, Luís Correia...