Sciweavers

591 search results - page 49 / 119
» A constraint programming approach to cutset problems
Sort
View
ANOR
2007
73views more  ANOR 2007»
13 years 8 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev
ATMOS
2007
114views Optimization» more  ATMOS 2007»
13 years 10 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
ISSTA
2010
ACM
14 years 12 days 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
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 8 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
ICCV
2009
IEEE
15 years 1 months ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu