Sciweavers

730 search results - page 71 / 146
» Combinatorics of Monotone Computations
Sort
View
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
13 years 11 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
ITS
2000
Springer
137views Multimedia» more  ITS 2000»
13 years 11 months ago
Design Principles for a System to Teach Problem Solving by Modelling
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
Gérard Tisseau, Hélène Giroir...
COCOON
2008
Springer
13 years 9 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
TSMC
2008
119views more  TSMC 2008»
13 years 7 months ago
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
Abstract--Reliability and sensitivity analysis is a key component in the design, tuning, and maintenance of network systems. Tremendous research efforts have been expended in this ...
Liudong Xing
COCOON
2011
Springer
12 years 7 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...