Sciweavers

2864 search results - page 413 / 573
» Constraint Programming in OPL
Sort
View
RECOMB
1998
Springer
14 years 1 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
LPNMR
1997
Springer
14 years 1 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
14 years 1 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
ASPDAC
2007
ACM
93views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Flow-Through-Queue based Power Management for Gigabit Ethernet Controller
- This paper presents a novel architectural mechanism and a power management structure for the design of an energy-efficient Gigabit Ethernet controller. Key characteristics of suc...
Hwisung Jung, Andy Hwang, Massoud Pedram
ASPDAC
2007
ACM
119views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
Jianhua Liu, Yi Zhu, Haikun Zhu, Chung-Kuan Cheng,...