Sciweavers

2191 search results - page 46 / 439
» Aspect - A Problem For MT
Sort
View
134
Voted
CEC
2009
IEEE
15 years 10 months ago
Towards an evolved lower bound for the most circular partition of a square
— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
Claudia Obermaier, Markus Wagner
141
Voted
LPNMR
2001
Springer
15 years 8 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
126
Voted
TCBB
2008
122views more  TCBB 2008»
15 years 3 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
115
Voted
ICSEA
2006
IEEE
15 years 9 months ago
Enforcing Interaction Properties in AOSD-Enabled Systems
The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various ...
Constantin Serban, Shmuel S. Tyszberowicz
180
Voted
CRIWG
2004
15 years 5 months ago
CreEx: A Framework for Creativity in Cooperative Problem Solving
Abstract. Creativity has become an important factor in recent years, as companies need to be able to quickly adapt to take advantage of new opportunities and handle fast paced chan...
Adriana Santarosa Vivacqua, Jano Moreira de Souza