Sciweavers

1650 search results - page 127 / 330
» The HOM problem is decidable
Sort
View
MFCS
2007
Springer
15 years 10 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
15 years 10 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
TABLEAUX
2005
Springer
15 years 9 months ago
Description Logics in Ontology Applications
Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
Ian Horrocks
ILP
2004
Springer
15 years 9 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
15 years 9 months ago
An Individual View on Cooperation Networks
Networks utilizing modern communication technologies can offer competitive advantages to those using them wisely. But due to the existence of network effects, planning and operati...
Tim Weitzel, Daniel Beimborn, Wolfgang König