Sciweavers

874 search results - page 117 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
CP
2007
Springer
15 years 8 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
119
Voted
DAC
2003
ACM
16 years 3 months ago
Compiler-generated communication for pipelined FPGA applications
In this paper, we describe a set of compiler analyses and an implementation that automatically map a sequential and un-annotated C program into a pipelined implementation, targete...
Heidi E. Ziegler, Mary W. Hall, Pedro C. Diniz

Publication
433views
15 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
DATE
2009
IEEE
143views Hardware» more  DATE 2009»
15 years 9 months ago
Time and memory tradeoffs in the implementation of AUTOSAR components
—The adoption of AUTOSAR in the development of automotive electronics can increase the portability and reuse of functional components. Inside each component, the behavior is repr...
Alberto Ferrari, Marco Di Natale, Giacomo Gentile,...
134
Voted
FGCS
2006
87views more  FGCS 2006»
15 years 2 months ago
Task distribution with a random overlay network
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...