Sciweavers

2607 search results - page 261 / 522
» Complete Functional Synthesis
Sort
View
112
Voted
COR
2006
86views more  COR 2006»
15 years 4 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska
CSDA
2007
100views more  CSDA 2007»
15 years 4 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
ENTCS
2007
82views more  ENTCS 2007»
15 years 4 months ago
Web Interfaces for Proof Assistants
This article describes an architecture for creating responsive web interfaces for proof assistants. The architecture combines current web development technologies with the functio...
Cezary Kaliszyk
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 4 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
127
Voted
CGF
2004
86views more  CGF 2004»
15 years 4 months ago
Visualizing Objects with Mirrors
We present an automatic camera and mirrors placement method for visualizing 3D scenes such that complete and nonredundant visibility is guaranteed, as well as highest image resolu...
Ferran Hurtado, Marc Noy, J.-M. Robert, Vera Sacri...