Sciweavers

1940 search results - page 181 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
15 years 4 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
CORR
2011
Springer
208views Education» more  CORR 2011»
15 years 1 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
MOC
1998
102views more  MOC 1998»
15 years 6 months ago
New results in equal sums of like powers
This paper reports on new results for the equation m i=1 ak i = n j=1 bk j , i.e., equal sums of like powers. Since the 1967 Lander, Parkin and Selfridge survey paper [4], few othe...
Randy L. Ekl
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 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...
CVPR
2010
IEEE
16 years 5 days ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson