Sciweavers

1749 search results - page 112 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng
LFCS
2007
Springer
14 years 2 months ago
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
André Platzer
TSP
2010
13 years 3 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
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 9 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
IEEEPACT
2009
IEEE
14 years 2 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar