Sciweavers

8009 search results - page 1418 / 1602
» cans 2005
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
16 years 2 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
16 years 3 hour ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
ICALP
2004
Springer
15 years 12 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
FLAIRS
2008
15 years 9 months ago
Towards Verification of Storyboards
Storyboards are commonly known as rows of pictures, which exemplarily sketch scenes in performing arts. The rows specify the sequence of scenes. The scenes themselves are illustra...
Rainer Knauf, Horst Duesel
BTW
2005
Springer
90views Database» more  BTW 2005»
15 years 8 months ago
The Importance of Being Earnest about Definitions
: Ideas from terminology management, the science of terms and definitions, can be used to improve the quality of software and data models, as well as to facilitate the achievement ...
Susan Thomas
« Prev « First page 1418 / 1602 Last » Next »