Sciweavers

2080 search results - page 303 / 416
» Measuring empirical computational complexity
Sort
View
MP
2006
87views more  MP 2006»
15 years 6 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
WCNC
2010
IEEE
15 years 4 months ago
A Recursive Battery Model for Nodes Lifetime Estimation in Wireless Sensor Networks
—Since sensor nodes use batteries as their source of energy, energy-based routing becomes an important requirement to extend network lifetime. This routing is done using the node...
Joseph Rahmé, Nicolas Fourty, Khaldoun Al A...
HPDC
2010
IEEE
15 years 7 months ago
Characterising a grid site's traffic
Grid computing has been widely adopted for intensive high performance computing. Since grid resources are distributed over complex large-scale infrastructures, understanding grid ...
Tiejun Ma, Yehia El-khatib, Michael Mackay, Christ...
ECCB
2002
IEEE
15 years 11 months ago
Stochastic roadmap simulation for the study of ligand-protein interactions
The dynamics of ligand-protein interactions are necessary to understand for the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simul...
Mehmet Serkan Apaydin, Carlos Guestrin, Chris Varm...
IPSN
2007
Springer
16 years 14 days ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter