Sciweavers

14518 search results - page 169 / 2904
» Two Problems for Sophistication
Sort
View
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 4 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 10 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
ICSM
2009
IEEE
13 years 8 months ago
Visualizing the structure of field testing problems
Field testing of a software application prior to general release is an important and essential quality assurance step. Field testing helps identify unforeseen problems. Extensive ...
Brian Chan, Ying Zou, Ahmed E. Hassan, Anand Sinha
AE
2007
Springer
14 years 4 months ago
An Evolutionary Algorithm for the Block Stacking Problem
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
Tim Hohm, Matthias Egli, Samuel Gaehwiler, Stefan ...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 4 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom