Sciweavers

1068 search results - page 164 / 214
» Factorization as a Rank 1 Problem
Sort
View
ADHOCNETS
2009
Springer
15 years 4 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
INFOCOM
2000
IEEE
15 years 2 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
MOC
2002
118views more  MOC 2002»
14 years 9 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 7 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
AIED
2009
Springer
15 years 4 months ago
Scaffolding Motivation and Metacognition in Learning Programming
This paper explores the role that feedback based on past actions and motivational states of the learner can have in a motivationally and metacognitively aware Intelligent Tutoring ...
Alison Hull, Benedict du Boulay