Sciweavers

75 search results - page 9 / 15
» Using DNA to solve the Bounded Post Correspondence Problem
Sort
View
DOCENG
2003
ACM
14 years 18 days ago
Using SVG as the rendering model for structured and graphically complex web material
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
Julius C. Mong, David F. Brailsford
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
CP
2011
Springer
12 years 7 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
DAWAK
2011
Springer
12 years 7 months ago
An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
Sang-Pil Kim, Yang-Sae Moon, Sun-Kyong Hong
NIPS
2008
13 years 8 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr