Sciweavers

7988 search results - page 1225 / 1598
» A Useful Undecidable Theory
Sort
View
CP
2005
Springer
16 years 13 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
ECML
2005
Springer
16 years 12 days ago
U-Likelihood and U-Updating Algorithms: Statistical Inference in Latent Variable Models
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
JaeMo Sung, Sung Yang Bang, Seungjin Choi, Zoubin ...
ECSQARU
2005
Springer
16 years 12 days ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
EMSOFT
2005
Springer
16 years 12 days ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 12 days ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
« Prev « First page 1225 / 1598 Last » Next »