Sciweavers

16504 search results - page 366 / 3301
» New Problems, New Solutions
Sort
View
WWW
2004
ACM
16 years 7 months ago
Web Design for the Semantic Web
To be able to realize the vision of the semantic web an important bottleneck that needs to be solved is an easy and intuitive approach for the annotation of websites with semantic...
Peter Plessers, Olga De Troyer
EVOW
2009
Springer
16 years 1 months ago
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
Steffen Wolf, Peter Merz
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
16 years 27 days ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders
SPIN
2001
Springer
15 years 11 months ago
Model Checking Systems of Replicated Processes with Spin
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking distributed systems with several instances of t...
Fabrice Derepas, Paul Gastin
ECML
2006
Springer
15 years 10 months ago
Bandit Based Monte-Carlo Planning
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
Levente Kocsis, Csaba Szepesvári