Sciweavers

11160 search results - page 401 / 2232
» Incompleteness in a General Setting
Sort
View
166
Voted
GD
2004
Springer
16 years 7 days ago
The Metro Map Layout Problem
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nasci...
DIS
2000
Springer
15 years 11 months ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 11 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
200
Voted
HYBRID
2000
Springer
15 years 10 months ago
Dynamical Systems Revisited: Hybrid Systems with Zeno Executions
Results from classical dynamical systems are generalized to hybrid dynamical systems. The concept of limit set is introduced for hybrid systems and is used to prove new results on...
Jun Zhang, Karl Henrik Johansson, John Lygeros, Sh...
CLIMA
2010
15 years 8 months ago
Hypergraphs of Multiparty Secrets
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as...
Sara Miner More, Pavel Naumov