Sciweavers

1884 search results - page 170 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 2 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
108
Voted
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 6 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
144
Voted
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 3 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
157
Voted
IANDC
2007
152views more  IANDC 2007»
15 years 2 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
99
Voted
IPPS
2007
IEEE
15 years 9 months ago
Library Function Selection in Compiling Octave
One way to address the continuing performance problem of high-level domain-specific languages, such as Octave or MATLAB, is to compile them to a relatively lower level language f...
Daniel McFarlin, Arun Chauhan