Sciweavers

673 search results - page 74 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
ICTAI
2002
IEEE
14 years 19 days ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
COCOA
2008
Springer
13 years 9 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
13 years 11 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
TSP
2010
13 years 2 months ago
Optimal linear fusion for distributed detection via semidefinite programming
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
Zhi Quan, Wing-Kin Ma, Shuguang Cui, Ali H. Sayed
ISSTA
2010
ACM
13 years 11 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder