Sciweavers

407 search results - page 51 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
DISOPT
2007
155views more  DISOPT 2007»
14 years 10 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
DAC
2009
ACM
15 years 11 months ago
ILP-based pin-count aware design methodology for microfluidic biochips
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...
Cliff Chiung-Yu Lin, Yao-Wen Chang
COR
2007
176views more  COR 2007»
14 years 10 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
ICCD
2008
IEEE
111views Hardware» more  ICCD 2008»
15 years 7 months ago
Test-access mechanism optimization for core-based three-dimensional SOCs
— Test-access mechanisms (TAMs) and test wrappers (e.g., the IEEE Standard 1500 wrapper) facilitate the modular testing of embedded cores in a core-based system-on-chip (SOC). Su...
Xiaoxia Wu, Yibo Chen, Krishnendu Chakrabarty, Yua...
CVIU
2008
109views more  CVIU 2008»
14 years 10 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios