Sciweavers

536 search results - page 79 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
126
Voted
KBSE
2002
IEEE
15 years 8 months ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta
136
Voted
APIN
2005
92views more  APIN 2005»
15 years 3 months ago
A Hybrid Neural-Genetic Algorithm for the Frequency Assignment Problem in Satellite Communications
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
Sancho Salcedo-Sanz, Carlos Bousoño-Calz&oa...
196
Voted
CVPR
2009
IEEE
16 years 11 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
196
Voted
PATAT
2004
Springer
151views Education» more  PATAT 2004»
15 years 9 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
102
Voted
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 9 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti