Sciweavers

13376 search results - page 481 / 2676
» Problem Solving with
Sort
View
171
Voted
JOTA
2011
149views more  JOTA 2011»
15 years 1 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
VL
2005
IEEE
135views Visual Languages» more  VL 2005»
15 years 12 months ago
Designing Features for Both Genders in End-User Programming Environments
Previous research has revealed gender differences that impact females’ willingness to adopt software features in end users’ programming environments. Since these features have...
Laura Beckwith, Shraddha Sorte, Margaret M. Burnet...
IJCAI
1993
15 years 7 months ago
Evolutionary Learning Strategy using Bug-Based Search
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
Hitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisu...
158
Voted
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 7 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
CP
2009
Springer
16 years 7 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga