Sciweavers

979 search results - page 110 / 196
» Footprints in Local Reasoning
Sort
View
AAAI
2006
13 years 9 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
GVD
2004
107views Database» more  GVD 2004»
13 years 9 months ago
A Representation of Time Series for Temporal Web Mining
Data with temporal information is constantly generated, sampled, gathered, and analyzed in different domains, such as medicine, finance, engineering, environmental sciences, and e...
Mireille Samia
ESANN
2006
13 years 9 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
ICWS
2004
IEEE
13 years 9 months ago
Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
Andreas Wombacher, Peter Fankhauser, Erich J. Neuh...
IJCAI
1997
13 years 9 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld