1174 search results - page 96 / 235 » Functional Trees |
138
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
134
Voted
SAFECOMP
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. This paper introduces a new method for safety analysis called HiPHOPS (Hierarchically Performed Hazard Origin and Propagation Studies). HiP-HOPS originates from a number ...
98
Voted
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
– This paper presents a method for designing classifier to automate an evaluation process of protein crystallization growth states. The classifier is designed by binary decision ...
114
Voted
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
163
click to vote
ACID
2006
15 years 3 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...