Sciweavers

2661 search results - page 320 / 533
» Quantum Complexity Classes
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 4 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
SOFTVIS
2010
ACM
15 years 4 months ago
User evaluation of polymetric views using a large visualization wall
There are few visualization techniques for displaying complex software systems with large numbers of packages and classes. One visualization technique is the System Hotspots View,...
Craig Anslow, Stuart Marshall, James Noble, Ewan D...
IAT
2008
IEEE
15 years 4 months ago
Cognitive Agents Integrating Rules and Reinforcement Learning for Context-Aware Decision Support
While context-awareness has been found to be effective for decision support in complex domains, most of such decision support systems are hard-coded, incurring significant develop...
Teck-Hou Teng, Ah-Hwee Tan
BDA
2007
15 years 5 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
CORR
2008
Springer
73views Education» more  CORR 2008»
15 years 3 months ago
On acceptance conditions for membrane systems: characterisations of L and NL
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
Niall Murphy, Damien Woods