2542 search results - page 193 / 509 » Computing Cartograms with Optimal Complexity |
87
Voted
STOC
2001
ACM
16 years 1 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 ...
136
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
109
Voted
AUTOMATICA
2004
15 years 20 days ago
2004
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
166
click to vote
CF
2011
ACM
14 years 23 days ago
2011
ACM
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...
102
Voted
IROS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...