Sciweavers

2657 search results - page 241 / 532
» On the complexity of hierarchical problem solving
Sort
View
FOSAD
2000
Springer
15 years 5 months ago
Security Goals: Packet Trajectories and Strand Spaces
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
Joshua D. Guttman
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 3 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
15 years 7 months ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
GCC
2005
Springer
15 years 7 months ago
Dynamic Models of Knowledge in Virtual Organizations
The dynamics of knowledge is important for virtual organizations (VOs) knowledge management (KM) to improve the fast response capabilities and flexible problem solving capabilities...
Yan Ren, Xueshan Luo
ITICSE
1997
ACM
15 years 6 months ago
Recursion and grammars for CS2
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
Viera K. Proulx