Sciweavers

14774 search results - page 343 / 2955
» Computational complexity and evolutionary computation
Sort
View
ISQED
2005
IEEE
140views Hardware» more  ISQED 2005»
16 years 7 days ago
Toward Quality EDA Tools and Tool Flows Through High-Performance Computing
As the scale and complexity of VLSI circuits increase, Electronic Design Automation (EDA) tools become much more sophisticated and are held to increasing standards of quality. New...
Aaron N. Ng, Igor L. Markov
ASIACRYPT
2005
Springer
16 years 6 days ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz
DIGRA
2005
Springer
16 years 6 days ago
Pretty good for a girl: gender, identity and computer games
Young people’s participation in online digital culture is one of the most efficient means by which they become proficient in the management of Information and Communications Tec...
Catherine Beavis
COMPGEOM
2004
ACM
16 years 3 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
WG
2004
Springer
16 years 4 hour ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji