Sciweavers

4797 search results - page 728 / 960
» The complexity of partition tasks
Sort
View
DEXAW
2005
IEEE
135views Database» more  DEXAW 2005»
16 years 26 days ago
Expert-Based Ontology Construction: A Case-Study in Horticulture
Abstract— Experts are capable of performing complex tasks in their specific field of expertise. To do this, they use a vast amount of explicit and tacit domain knowledge. For v...
Nicole J. J. P. Koenderink, Jan L. Top, Lucas J. v...
DSN
2005
IEEE
16 years 26 days ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
EH
2005
IEEE
171views Hardware» more  EH 2005»
16 years 26 days ago
Implementation Results for a Fault-Tolerant Multicellular Architecture Inspired by Endocrine Communication
The hybrid redundancy structure found at the cellular level of higher animals provides complex organism with the three key features of a reliability-engineered system: fault toler...
Andrew J. Greensted, Andy M. Tyrrell
FOCS
2005
IEEE
16 years 26 days ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...
Anna R. Karlin, David Kempe, Tami Tamir
FOCS
2005
IEEE
16 years 26 days ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx