Sciweavers

5331 search results - page 137 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ACMSE
2006
ACM
15 years 4 months ago
Reconstructing networks using co-temporal functions
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
Edward E. Allen, Anthony Pecorella, Jacquelyn S. F...
CSL
2010
Springer
14 years 11 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 4 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
WSC
2007
15 years 9 days ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
NETWORKS
2008
14 years 10 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani