Sciweavers

3946 search results - page 56 / 790
» The computational complexity of choice sets
Sort
View
IPSN
2010
Springer
15 years 6 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
ORDER
2010
110views more  ORDER 2010»
14 years 10 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
SIGCSE
2009
ACM
213views Education» more  SIGCSE 2009»
16 years 12 days ago
Engaging middle school teachers and students with alice in a diverse set of subjects
This paper describes the integration of the Alice 3D virtual worlds environment into a diverse set of subjects in middle school, including the development of tutorials, example wo...
Susan H. Rodger, Jenna Hayes, Gaetjens Lezin, Henr...
INFSOF
2002
78views more  INFSOF 2002»
14 years 11 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...
CIE
2005
Springer
15 years 5 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov