3172 search results - page 287 / 635 » New developments of the Z-EDM algorithm |
152
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
156
click to vote
ICSE
2005
IEEE-ACM
16 years 6 months ago
2005
IEEE-ACM
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
167
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Abstract— Timing and low power emerge as the most important goals in contemporary design. Meanwhile, the majority of placement algorithms developed by industry and academia still...
173
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
159
click to vote
IPPS
2006
IEEE
16 years 17 days ago
2006
IEEE
The novel design of an efficient FPGA interconnection architecture with multiple Switch Boxes (SB) and hardwired connections for realizing data intensive applications (i.e. DSP ap...