Sciweavers

3591 search results - page 380 / 719
» Typing linear constraints
Sort
View
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 1 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
ICASSP
2009
IEEE
16 years 1 months ago
RLS-weighted Lasso for adaptive estimation of sparse signals
The batch least-absolute shrinkage and selection operator (Lasso) has well-documented merits for estimating sparse signals of interest emerging in various applications, where obse...
Daniele Angelosante, Georgios B. Giannakis
COCOA
2009
Springer
16 years 1 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
GLOBECOM
2007
IEEE
16 years 1 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
COCOA
2007
Springer
16 years 28 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle