Sciweavers

458 search results - page 74 / 92
» Totally magic graphs
Sort
View
AAAI
2007
13 years 10 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
DCOSS
2008
Springer
13 years 9 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
OPODIS
2008
13 years 9 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...
NIPS
2004
13 years 9 months ago
Large-Scale Prediction of Disulphide Bond Connectivity
The formation of disulphide bridges among cysteines is an important feature of protein structures. Here we develop new methods for the prediction of disulphide bond connectivity. ...
Pierre Baldi, Jianlin Cheng, Alessandro Vullo
AI
2006
Springer
13 years 7 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth