Sciweavers

713 search results - page 120 / 143
» Reasoning with Projected Contours
Sort
View
MP
2002
165views more  MP 2002»
13 years 7 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
JBI
2011
233views Bioinformatics» more  JBI 2011»
13 years 2 months ago
A set of ontologies to drive tools for the control of vector-borne diseases
We are developing a set of ontologies that deal with vector-borne diseases and the arthropod vectors that transmit them. For practical reasons (application priorities), we initiat...
Pantelis Topalis, Emmanuel Dialynas, Elvira Mitrak...
SIGSOFT
2008
ACM
14 years 8 months ago
Extended exceptions for contingencies and their implications for the engineering process
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
Thorsten van Ellen, Wilhelm Hasselbring
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
CADE
2009
Springer
14 years 8 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...