Sciweavers

12981 search results - page 2210 / 2597
» Model Checking (Abstract)
Sort
View
144
Voted
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
15 years 11 months ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
ADHOCNETS
2009
Springer
15 years 11 months ago
Cooperative Localization in GPS-Limited Urban Environments
Abstract. Existing localization techniques such as GPS have fundamental limitations which preclude deployment in urban canyons or areas with inconsistent network availability. Augm...
Jeffrey Hemmes, Douglas Thain, Christian Poellabau...
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 11 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
ADMI
2009
Springer
15 years 11 months ago
Towards Cooperative Predictive Data Mining in Competitive Environments
Abstract. We study the problem of predictive data mining in the competitive multi-agent setting, in which each agent is assumed to have some partial knowledge needed for correctly ...
Viliam Lisý, Michal Jakob, Petr Benda, Step...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 11 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
« Prev « First page 2210 / 2597 Last » Next »