63 search results - page 11 / 13 » Sample-dependent graph construction with application to dime... |
ICSE
1995
IEEE-ACM
13 years 11 months ago
1995
IEEE-ACM
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
TIT
2008
13 years 7 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
JCO
1998
13 years 7 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
ISCI
2007
13 years 7 months ago
2007
: In our book to appear in print from Springer-Verlag GmbH, Simulating Continuous Fuzzy Systems, Buckley and Jowers, we use crisp continuous simulation under Matlab™/Simulink™ ...