Sciweavers

5316 search results - page 158 / 1064
» Which Search Problems Are Random
Sort
View
132
Voted
WSC
2008
15 years 6 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser
143
Voted
UM
2007
Springer
15 years 9 months ago
Identifiability: A Fundamental Problem of Student Modeling
In this paper we show how model identifiability is an issue for student modeling: observed student performance corresponds to an infinite family of possible model parameter estimat...
Joseph E. Beck, Kai-min Chang
112
Voted
ICC
2007
IEEE
15 years 10 months ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
277
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
97
Voted
GECCO
2003
Springer
15 years 8 months ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...