Sciweavers

Share
AMC
2005
150views more  AMC 2005»
8 years 12 months ago
High order fitted operator numerical method for self-adjoint singular perturbation problems
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
Kailash C. Patidar
AIM
2005
8 years 12 months ago
If Not Turing's Test, Then What?
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
Paul R. Cohen
AI
2005
Springer
8 years 12 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
SIGCSE
2008
ACM
116views Education» more  SIGCSE 2008»
8 years 12 months ago
Socially relevant computing
In this paper, we introduce socially relevant computing as a new way to reinvigorate interest in computer science. Socially relevant computing centers on the use of computation to...
Michael Buckley, John Nordlinger, Devika Subramani...
SIAMSC
2008
104views more  SIAMSC 2008»
8 years 12 months ago
Deblurring Methods Using Antireflective Boundary Conditions
In this note we consider the numerical solution of selfadjoint deblurring problems on bounded intervals. For these problems it has recently been shown that appropriate modelling of...
Martin Christiansen, Martin Hanke
SIAMJO
2008
85views more  SIAMJO 2008»
8 years 12 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
SIAMJO
2008
112views more  SIAMJO 2008»
8 years 12 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
SIAMJO
2008
99views more  SIAMJO 2008»
8 years 12 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
IJAC
2007
57views more  IJAC 2007»
8 years 12 months ago
Some Group Theory Problems
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems ...
Mark V. Sapir
SIAMCO
2008
70views more  SIAMCO 2008»
8 years 12 months ago
Duality in Linear Programming Problems Related to Deterministic Long Run Average Problems of Optimal Control
It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
Luke Finlay, Vladimir Gaitsgory, Ivan Lebedev
books