Sciweavers

2974 search results - page 320 / 595
» Model-Driven Constraint Programming
Sort
View
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 7 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
ICASSP
2009
IEEE
16 years 1 months ago
A global optimization framework for meeting summarization
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
Daniel Gillick, Korbinian Riedhammer, Benoît...
LOPSTR
2009
Springer
16 years 1 months ago
LP with Flexible Grouping and Aggregates Using Modes
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
Marcin Czenko, Sandro Etalle
CASSIS
2004
Springer
16 years 20 hour ago
Mobile Resource Guarantees for Smart Devices
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
David Aspinall, Stephen Gilmore, Martin Hofmann, D...
EVOW
2004
Springer
16 years 12 hour ago
Evolutionary Design Space Exploration for Median Circuits
This paper shows that it is possible to (1) discover novel implementations of median circuits using evolutionary techniques and (2) find out suitable median circuits in case that ...
Lukás Sekanina