Sciweavers

4865 search results - page 815 / 973
» The Complexity of Graph Connectivity
Sort
View
SDL
2007
139views Hardware» more  SDL 2007»
15 years 5 months ago
A Model-Based Standard for SDL
Abstract. It is still the case that language descriptions have lots of semantic information captured using plain (English) text. These imprecise descriptions are hardly usable for ...
Andreas Prinz, Markus Scheidgen, Merete Skjelten T...
127
Voted
WICON
2008
15 years 5 months ago
Constructing accurate, space-efficient, wireless coverage maps for vehicular contexts
Wireless connectivity for vehicles is a fast-growing market, with a plethora of different network technologies already in use. Surveys of the numbers of IEEE 802.11b/g access poin...
David N. Cottingham, Robert K. Harle, Andy Hopper
AAAI
2006
15 years 5 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
142
Voted
AAAI
2006
15 years 5 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
ACID
2006
236views Algorithms» more  ACID 2006»
15 years 5 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....