Sciweavers

220 search results - page 21 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
COMPSAC
2003
IEEE
14 years 1 months ago
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
Ying Zou, Kostas Kontogiannis
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 8 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
14 years 9 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial