1017 search results - page 57 / 204 » Some existence and construction results of polygonal designs |
104
click to vote
EUROCAST
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
103
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Redundancy Addition and Removal (RAR) is a restructuring technique used in the synthesis and optimization of logic designs. It can remove an existing target wire and add an alte...
CRIWG
2004
15 years 1 months ago
2004
Abstract. This work presents a middleware for collaborative applications that increase product and workspace awareness information available to users of computer-aided software eng...
DOA
2000
15 years 1 months ago
2000
XML has emerged as the universal standard for exchanging and externalizing data. Software products of all kinds are being upgraded to "support XML." Typically this means...