Sciweavers

3757 search results - page 562 / 752
» The overlap number of a graph
Sort
View
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
16 years 1 months ago
Exploiting structure in an AIG based QBF solver
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
Florian Pigorsch, Christoph Scholl
IPPS
2009
IEEE
16 years 1 months ago
Sensor network connectivity with multiple directional antennae of a given angular sum
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi,...
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 1 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
ECSQARU
2009
Springer
16 years 1 months ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Vasiliki Efstathiou, Anthony Hunter
ICPR
2008
IEEE
16 years 28 days ago
Ranking the local invariant features for the robust visual saliencies
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...
Shengping Xia, Peng Ren, Edwin R. Hancock