Sciweavers

4843 search results - page 750 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
118
Voted
SIAMSC
2008
191views more  SIAMSC 2008»
15 years 3 months ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
131
Voted
IJBRA
2007
80views more  IJBRA 2007»
15 years 3 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
155
Voted
ADHOC
2005
116views more  ADHOC 2005»
15 years 3 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
125
Voted
TCS
2008
15 years 3 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
123
Voted
JACM
2007
121views more  JACM 2007»
15 years 3 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...