Sciweavers

11160 search results - page 411 / 2232
» Incompleteness in a General Setting
Sort
View
ACTA
2008
136views more  ACTA 2008»
15 years 7 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
ENGL
2007
89views more  ENGL 2007»
15 years 6 months ago
Similarity-based Heterogeneous Neural Networks
This research introduces a general class of functions serving as generalized neuron models to be used in artificial neural networks. They are cast in the common framework of comp...
Lluís A. Belanche Muñoz, Julio Jose ...
PR
2006
102views more  PR 2006»
15 years 6 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
SIAMJO
2008
175views more  SIAMJO 2008»
15 years 6 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
PASTE
2004
ACM
16 years 9 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick