Sciweavers

3663 search results - page 15 / 733
» Problems in the ontology of computer programs
Sort
View
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 8 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
FOIS
2006
13 years 10 months ago
Nontological Engineering
This article reflects an ongoing effort to systematize the use of terms applied by philosophers and computer scientists in the context of ontology and ontological engineering. We s...
Waclaw Kusnierczyk
JGO
2008
83views more  JGO 2008»
13 years 8 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
ELPUB
2007
ACM
14 years 15 days ago
Towards an Ontology of ElPub/SciX: A Proposal
A proposal is presented for a standard ontology language defined as ElPub/SciX Ontology, based on the content of a web digital library of conference proceedings. This content, i.e...
Sely Maria de Souza Costa, Cláudio Gottscha...
KR
2004
Springer
14 years 1 months ago
Observation Expectation Reasoning in Agent Systems
The computational grounding problem – the gap between the mental models of an agent and its computational model – is a well known problem within the agent research community. ...
Bình Vu Trân, James Harland, Margaret...