Sciweavers

14649 search results - page 397 / 2930
» Principles of problem solving
Sort
View
155
Voted
MOC
1998
96views more  MOC 1998»
15 years 6 months ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche
TJS
2002
122views more  TJS 2002»
15 years 6 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
NETWORKS
2007
15 years 6 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
RC
2007
64views more  RC 2007»
15 years 6 months ago
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
Daniel Berleant, Olga Kosheleva, Vladik Kreinovich...
HIS
2009
15 years 4 months ago
A Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various ...
Chao-Li Sun, Jian-Chao Zeng, Jeng-Shyang Pan