Sciweavers

16504 search results - page 288 / 3301
» New Problems, New Solutions
Sort
View
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
IEEEARES
2006
IEEE
16 years 21 days ago
Testing Complex Business Process Solutions
—Today’s business climate requires you to constantly evolve IT strategies responding to new opportunities or threats. While the fundamentals of IT - reliability, availability, ...
Gerd Saurer, Alexander Schatten
MOC
2010
15 years 1 months ago
Global smooth solution curves using rigorous branch following
In this paper, we present a new method to rigorously compute smooth branches of zeros of nonlinear operators f : Rl1
Jan Bouwe van den Berg, Jean-Philippe Lessard, Kon...
CSR
2007
Springer
16 years 25 days ago
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
Ehsan Amiri, Evgeny S. Skvortsov
SIAMJO
2002
87views more  SIAMJO 2002»
15 years 6 months ago
An Optimization Approach for Radiosurgery Treatment Planning
We outline a new approach for radiosurgery treatment planning, based on solving a series of optimization problems. We consider a specific treatment planning problem for a speciali...
Michael C. Ferris, Jinho Lim, David M. Shepard