ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (31)
  • optimization  (31)
  • Springer  (31)
  • 1995-1999  (31)
  • 1955-1959
  • 1945-1949
  • Computer Science  (27)
  • Geography  (4)
  • 1
    Electronic Resource
    Electronic Resource
    Code Optimization Techniques in Embedded DSP Microprocessors (1998)
    Springer
    Design automation for embedded systems 3 (1998), S. 59-73 
    Details
    ISSN: 1572-8080
    Keywords: Code generation ; optimization ; digital signal processors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventional code generation methods typically result in inefficient code. In this paper we formulate and solve some optimization problems that arise in code generation for processors with irregular datapaths. In addition to instruction scheduling and register allocation, we also formulate the accumulator spilling and mode selection problems that arise in DSP microprocessors. We present optimal and heuristic algorithms that determine an instruction schedule simultaneously optimizing accumulator spilling and mode selection. Experimental results are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008803430710
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The achievable region method in the optimal control of queueing systems; formulations, bounds and policies (1995)
    Springer
    Queueing systems 21 (1995), S. 337-389 
    Details
    ISSN: 1572-9443
    Keywords: Queueing networks ; loss networks ; multiarmed bandits ; bounds ; policies ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We survey a new approach that the author and his co-workers have developed to formulate stochastic control problems (predominantly queueing systems) asmathematical programming problems. The central idea is to characterize the region of achievable performance in a stochastic control problem, i.e., find linear or nonlinear constraints on the performance vectors that all policies satisfy. We present linear and nonlinear relaxations of the performance space for the following problems: Indexable systems (multiclass single station queues and multiarmed bandit problems), restless bandit problems, polling systems, multiclass queueing and loss networks. These relaxations lead to bounds on the performance of an optimal policy. Using information from the relaxations we construct heuristic nearly optimal policies. The theme in the paper is the thesis that better formulations lead to deeper understanding and better solution methods. Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper formulations (polyhedral combinatorics and more recently nonlinear relaxations) and leads to new insights ranging from a complete characterization and new algorithms for indexable systems to tight lower bounds and nearly optimal algorithms for restless bandit problems, polling systems, multiclass queueing and loss networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01149167
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Radio Link Frequency Assignment (1999)
    Springer
    Constraints 4 (1999), S. 79-89 
    Details
    ISSN: 1572-9354
    Keywords: benchmarks ; radio link frequency assignment ; constraint satisfaction ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009812409930
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison (1999)
    Springer
    Constraints 4 (1999), S. 199-240 
    Details
    ISSN: 1572-9354
    Keywords: overconstrained problems ; constraint satisfaction ; optimization ; soft constraint ; dynamic programming ; branch and bound ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in ijcai95,jacm and schiex-ijcai95.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1026441215081
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Optimal multithreshold control for a BMAP/G/1 queue with N service modes (1998)
    Springer
    Queueing systems 30 (1998), S. 273-287 
    Details
    ISSN: 1572-9443
    Keywords: single server queue ; controlled service rate ; batch Markovian arrival process ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper deals with the problem of the optimal service rate control in the system with BMAP (Batch Markovian Arrival Process) arrival stream. An algorithm for the computation of the embedded stationary queue length distribution is developed. The procedure for the cost criteria calculation is elaborated for any fixed parameters of the multithreshold control policy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1019121222439
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Inference Duality as a Basis for Sensitivity Analysis (1999)
    Springer
    Constraints 4 (1999), S. 101-112 
    Details
    ISSN: 1572-9354
    Keywords: sensitivity analysis ; duality ; optimization ; inference
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The constraint programming community has recently begun to address certain types of optimization problems. These problems tend to be discrete or to have discrete elements. Although sensitivity analysis is well developed for continuous problems, progress in this area for discrete problems has been limited. This paper proposes a general approach to sensitivity analysis that applies to both continuous and discrete problems. In the continuous case, particularly in linear programming, sensitivity analysis can be obtained by solving a dual problem. One way to broaden this result is to generalize the classical idea of a dual to that of an “inference dual,” which can be defined for any optimization problem. To solve the inference dual is to obtain a proof of the optimal value of the problem. Sensitivity analysis can be interpreted as an analysis of the role of each constraint in this proof. This paper shows that traditional sensitivity analysis for linear programming is a special case of this approach. It also illustrates how the approach can work out in a discrete problem by applying it to 0-1 linear programming (linear pseudo-boolean optimization).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009838725226
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Scheduling policies using marked/phantom slot algorithms (1995)
    Springer
    Queueing systems 20 (1995), S. 207-254 
    Details
    ISSN: 1572-9443
    Keywords: Scheduling ; random polling ; optimization ; perturbation analysis ; Golden Ratio policy ; radio network
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We address the problem of schedulingM customer classes in a single-server system, with customers arriving in one ofN arrival streams, as it arises in scheduling transmissions in packet radio networks. In general,N≠M and a customer from some stream may join one of several classes. We consider a slotted time model where at each scheduling epoch the server (channel) is assigned to a particular class (transmission set) and can serve multiple customers (packets) simultaneously, one from every arrival stream (network node) that can belong to this class. The assignment is based on arandom polling policy: the current time slot is allocated to theith class with probability θi. Our objective is to determine the optimal probabilities by adjusting them on line so as to optimize some overall performance measure. We present an approach based on perturbation analysis techniques, where all customer arrival processes can be arbitrary, and no information about them is required. The basis of this approach is the development of two sensitivity estimators leading to amarked slot and aphantom slot algorithm. The algorithms determine the effect of removing/ adding service slots to an existing schedule on the mean customer waiting times by directly observing the system. The optimal slot assignment probabilities are then used to design adeterministic scheduling policy based on the Golden Ratio policy. Finally, several numerical results based on a simple optimization algorithm are included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01158437
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    A note on logspace optimization (1995)
    Springer
    Computational complexity 5 (1995), S. 155-166 
    Details
    ISSN: 1420-8954
    Keywords: Complexity classes ; nondeterministic logspace ; optimization ; iterated multiplication ; 68Q15 ; 68Q25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We show that computing iterated multiplication of word matrices over {0,1}*, using the operations maximum and concatenation, is complete for the class optL of logspace optimization functions. The same problem for word matrices over {1}* is complete for the class FNL of nondeterministic logspace functions. Improving previously obtained results, we furthermore place the class optL in AC1, and characterize FNL by restricted logspace optimization functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01268143
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Comparison of Extended Jacobian and Lagrange Multiplier Based Methods for Resolving Kinematic Redundancy (1997)
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 39-54 
    Details
    ISSN: 1573-0409
    Keywords: extended Jacobian method ; Lagrange multiplier method ; kinematically redundant manipulators ; numerical efficiency ; optimization ; robotics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Several methods have been proposed in the past for resolving the control of kinematically redundant manipulators by optimizing a secondary criterion. The extended Jacobian method constrains the gradient of this criterion to be in the null space of the Jacobian matrix, while the Lagrange multiplier method represents the gradient as being in the row space. In this paper, a numerically efficient form of the Lagrange multiplier method is presented and is compared analytically, computationally, and operationally to the extended Jacobian method. This paper also presents an improved method for tracking algorithmic singularities over previous work.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007941331202
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Probability-Based Weighting of Performance Criteria for Redundant Manipulators (1997)
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 89-103 
    Details
    ISSN: 1573-0409
    Keywords: kinematics ; manipulator ; optimization ; performance criteria ; redundancy ; robot
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract A method to simultaneously optimize multiple performance criteria for a redundant manipulator is presented. Preferred formulation requirements for the criteria are discussed, and previously proposed normalization methods are examined. A statistically based variable weighting technique is developed and evaluated. A seven-degree-of-freedom Robotics Research Corporation manipulator is used as a test bed for the multiple criteria optimization scheme.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007949601160
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Learning Complex Tasks Using a Stepwise Approach (1999)
    Springer
    Journal of intelligent and robotic systems 24 (1999), S. 43-68 
    Details
    ISSN: 1573-0409
    Keywords: learning robots ; system organization ; optimization ; physical equation ; look-ut table ; neural networks ; fuzzy controllers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper explores a stepwise learning approach based on a system's decomposition into functional subsystems. Two case studies are examined: a visually guided robot that learns to track a maneuvering object, and a robot that learns to use the information from a force sensor in order to put a peg into a hole. These two applications show the features and advantages of the proposed approach: i) the subsystems naturally arise as functional components of the hardware and software; ii) these subsystems are building blocks of the robot behavior and can be combined in several ways for performing various tasks; iii) this decomposition makes it easier to check the performances and detect the cause of a malfunction; iv) only those subsystems for which a satisfactory solution is not available need to be learned; v) the strategy proposed for coordinating the optimization of all subsystems ensures an improvement at the task-level; vi) the overall system's behavior is significantly improved by the stepwise learning approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008058131402
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    Globally Optimal Trajectory Planning for Redundant Manipulators using State Space Augmentation Method (1997)
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 105-117 
    Details
    ISSN: 1573-0409
    Keywords: optimization ; Pontryagin’s maximum principle ; redundant manipulators ; state-space augmentation ; trajectory planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The off-line global trajectory planning for kinematically redundant manipulators is formulated as an optimization problem whose solution is obtained by applying the Pontryagin’s Maximum Principle. The state space augmentation method is developed to obtain a set of optimal joint trajectories corresponding to a singularity-free Cartesian path which avoids joint limits and conserves joint configuration in cyclic motion. Results of computer simulation conducted on a three-degree-of-freedom planar manipulator are presented and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007905817998
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Coordination and Control of Multi-fingered Robot Hands with Rolling and Sliding Contacts (1999)
    Springer
    Journal of intelligent and robotic systems 24 (1999), S. 125-149 
    Details
    ISSN: 1573-0409
    Keywords: planning ; control ; multi-fingered robot hand ; optimization ; internal force ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, the problem of controlling multi-fingered robot hands with rolling and sliding contacts is addressed. Several issues are explored. These issues involve the kinematic analysis and modeling, the dynamic analysis and control, and the coordination of a multi-fingered robot hand system. Based on a hand-object system in which the contacts are allowed to both roll and slide, a kinematic model is derived and analyzed. Also, the dynamic model of the hand-object system with relative motion contacts is studied. A control law is proposed to guarantee the asymptotic tracking of the object trajectory together with the desired rolling and/or sliding motions along the surface of the object. A planning approach is then introduced to minimize the contact forces so that the desired motion of the object and the relative motions between the fingers and the object can be achieved. Simulation results which support the theoretical development are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008097528538
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Solving Irregular Econometric and Mathematical Optimization Problems with a Genetic Hybrid Algorithm (1999)
    Springer
    Computational economics 13 (1999), S. 103-115 
    Details
    ISSN: 1572-9974
    Keywords: optimization ; econometric functions ; nonlinear programming ; evolutionary programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Economics
    Notes: Abstract In the present paper we apply a new Genetic Hybrid Algorithm (GHA) to globally minimize a representative set of ill-conditioned econometric/mathematical functions. The genetic algorithm was specifically designed for nonconvex mixed integer nonlinear programming problems and it can be successfully applied to both global and constrained optimization. In previous studies, we have demonstrated the efficiency of the GHA in solving complicated NLP, INLP and MINLP problems. The present study is a continuation of this research, now focusing on a set of highly irregular optimization problems. In this paper we discuss the genetic hybrid algorithm, the nonlinear problems to be solved and present the results of the empirical tests.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008621308348
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Approximation of the capillarity problem by an augmented lagrangian method (1996)
    Springer
    Numerical algorithms 12 (1996), S. 321-346 
    Details
    ISSN: 1572-9265
    Keywords: Capillarity ; numerical approximation ; optimization ; 65Dxx ; 65Gxx ; 65K10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose an algorithm to compute an approximation of capillary surfaces in a gravitational field. This algorithm is based on a decomposition-coordination method by augmented lagrangians and the discretization is done using the finite element method. We study the convergence of the algorithm and the error of discretization for the axisymmetric case; some numerical results are given. This method can be generalized to a two-dimensional space.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02142811
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Mathematical Analysis and Optimization of Infiltration Processes (1998)
    Springer
    Journal of scientific computing 13 (1998), S. 303-321 
    Details
    ISSN: 1573-7691
    Keywords: Infiltration processes ; optimization ; partial differential equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A variety of infiltration techniques can be used to fabricate solid materials, particularly composites. In general these processes can be described with at least one time dependent partial differential equation describing the evolution of the solid phase, coupled to one or more partial differential equations describing mass transport through a porous structure. This paper presents a detailed mathematical analysis of a relatively simple set of equations which is used to describe chemical vapor infiltration. The results demonstrate that the process is controlled by only two parameters, α and β. The optimization problem associated with minimizing the infiltration time is also considered. Allowing α and β to vary with time leads to significant reductions in the infiltration time, compared with the conventional case where α and β are treated as constants.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1023271100371
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    Neural network for optimal steiner tree computation (1996)
    Springer
    Neural processing letters 3 (1996), S. 139-149 
    Details
    ISSN: 1573-773X
    Keywords: Steiner tree ; neural networks ; Hopfield model ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00420283
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    The Racing Algorithm: Model Selection for Lazy Learners (1997)
    Springer
    Artificial intelligence review 11 (1997), S. 193-225 
    Details
    ISSN: 1573-7462
    Keywords: lazy learning ; model selection ; cross validation ; optimization ; attribute selection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a set of models and some training data, we would like to find the model that best describes the data. Finding the model with the lowest generalization error is a computationally expensive process, especially if the number of testing points is high or if the number of models is large. Optimization techniques such as hill climbing or genetic algorithms are helpful but can end up with a model that is arbitrarily worse than the best one or cannot be used because there is no distance metric on the space of discrete models. In this paper we develop a technique called “racing” that tests the set of models in parallel, quickly discards those models that are clearly inferior and concentrates the computational effort on differentiating among the better models. Racing is especially suitable for selecting among lazy learners since training requires negligible expense, and incremental testing using leave-one-out cross validation is efficient. We use racing to select among various lazy learning algorithms and to find relevant features in applications ranging from robot juggling to lesion detection in MRI scans.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1006556606079
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Multicasting VP design methodology using simulated annealing in an ATM network (1996)
    Springer
    Journal of network and systems management 4 (1996), S. 133-153 
    Details
    ISSN: 1573-7705
    Keywords: High-speed network management ; ATM network management ; multipoint virtual paths design ; optimization ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Multicast routing over semi-permanent VP (virtual path)s in an ATM (asynchronous transfer mode)-based B-ISDN (broadband integrated services digital network) determines a set of VPs connecting from a source node to destination nodes. The problem of finding the optimal constrained multicasting tree over the semi-permanent VPs in an ATM network is known to be NP (nondeterministic polynomial time)-complete. We develop an optimization methodology for searching a constrained multicast routing tree with minimum cost, using simulated annealing technique. We define the problem-dependent components such as state space and cost function, and refine the implementation-dependent factors including initial temperature and cooling schedule. The simulation results show that our optimization methodology demonstrates good behavior in terms of performance on a variety of graphs modeling the sample ATM networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02139131
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    A New Relaxation Procedure in the Hopfield Network for Solving Optimization Problems (1999)
    Springer
    Neural processing letters 10 (1999), S. 211-222 
    Details
    ISSN: 1573-773X
    Keywords: constraint satisfaction ; Hopfield network ; neural networks ; optimization ; relaxation procedure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When solving an optimization problem with a Hopfield network, a solution is obtained after the network is relaxed to an equilibrium state. The relaxation process is an important step in achieving a solution. In this paper, a new procedure for the relaxation process is proposed. In the new procedure, the amplified signal received by a neuron from other neurons is treated as the target value for its activation (output) value. The activation of a neuron is updated directly based on the difference between its current activation and the received target value, without using the updating of the input value as an intermediate step. A relaxation rate is applied to control the updating scale for a smooth relaxation process. The new procedure is evaluated and compared with the original procedure in the Hopfield network through simulations based on 200 randomly generated instances of the 10-city traveling salesman problem. The new procedure reduces the error rate by 34.6% and increases the percentage of valid tours by 194.6% as compared with the original procedure.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018780424422
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    Training Reinforcement Neurocontrollers Using the Polytope Algorithm (1999)
    Springer
    Neural processing letters 9 (1999), S. 119-127 
    Details
    ISSN: 1573-773X
    Keywords: reinforcement learning ; neurocontrol ; optimization ; polytope algorithm ; pole balancing ; genetic reinforcement
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorithm to adjust the weights of the action network so that a simple direct measure of the training performance is maximized. Experimental results from the application of the method to the pole balancing problem indicate improved training performance compared with critic-based and genetic reinforcement approaches.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018669223478
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    On Solving Aquifer Management Problems with Simulated Annealing Algorithms (1999)
    Springer
    Water resources management 13 (1999), S. 153-170 
    Details
    ISSN: 1573-1650
    Keywords: Aquifer management ; infrastructure location ; least-cost design and operation ; optimization ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract Aquifer systems play an essential role in meeting the ever increasing use of water for different purposes. Proper design and management of such systems should therefore be a very important matter of concern, not only to ensure that water will be available in adequate quantity (and quality) to satisfy demands but also to guarantee that this would be done in an optimal manner. This paper presents a model serving to define which water supply structures (especially pumping equipment and pipes) should be installed in order to minimize the sum of set-up costs and operation costs while satisfying demands, using a heuristic approach based on simulated annealing. Annealing algorithms are random local search optimization algorithms that allow, at least in theory and in probability, the determination of a global optimum of a (possibly constrained) function.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008149626428
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    Genetic Algorithms for Optimal Operation of Soil Aquifer Treatment Systems (1998)
    Springer
    Water resources management 12 (1998), S. 375-396 
    Details
    ISSN: 1573-1650
    Keywords: genetic algorithms ; groundwater recharge ; optimization ; soil aquifer treatment
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract The genetic algorithm (GA) is a nonconventional search technique which is patterned after the biological processes of natural selection and evolution. It has the ability to search large and complex decision spaces and handle nonconvexities. In this paper, the genetic algorithm is investigated and applied to solve the optimal operation problem of soil aquifer treatment (SAT) systems. This problem involves finding optimal water application time and drying time which maximize infiltration for a predetermined starting influent rate of waste water and subject to various physical and operational constraints. A new scaling method is developed and some improvements on the evolution procedure are presented. A comprehensive GA–SAT computer model was developed and applied to an example SAT problem. The results are encouraging, when compared with using the successive approximation linear quadratic regulator algorithm. It was found that genetic algorithms are easy to program and interface with large complicated simulators.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008030612068
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    A Planning Model for the Fuerte-Carrizo Irrigation System, Mexico (1997)
    Springer
    Water resources management 11 (1997), S. 165-184 
    Details
    ISSN: 1573-1650
    Keywords: optimization ; linear programming ; simulation ; irrigation planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract A methodology is presented for planning the operation of the Fuerte-Carrizo irrigation system in northwest Mexico. The system has two storage dams, two irrigation districts, and water transfer capabilities between both dams. The methodology uses a combination of linear programming (LP) and simulation. The LP model maximizes the net return of the farmers, subject to restrictions of the system, availability of water and land, and water transfer relationships. The simulation model is programmed as a microcomputer interactive package simulating the performance of the system. The methodology has proven to be a useful tool to assist those responsible for the operation of the irrigation system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007910530591
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Optimal allocation of water resources in large river basins: I. Theory (1995)
    Springer
    Water resources management 9 (1995), S. 39-51 
    Details
    ISSN: 1573-1650
    Keywords: multiobjective ; optimization ; systems engineering ; water resources allocation ; Hierarchical dynamic programming ; subregion ; trunk stream ; basin
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract The major purpose of this paper is to present the useful techniques in the optimal allocation of water resources (OAWR) and to demonstrate using water resources applications how these methods can be conveniently employed in practice for systematically studying both simple and complex water resources problems. Formal modelling techniques in multiobjective decision-making provide many benefits to professionals working in water resources and elsewhere. A new Large-system Hierarchical Dynamic Programming (LHDP) method to solve the model can be carried out to ascertain the consequences of meaningful parameter changes upon the optimal or compromise solution. As a case study, the techniques and methods are applied to the OAWR of the Yellow River Basin (YRB) of China. The next paper shares with the reader recent research results on the OAWRYRB.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00877388
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Some Remarks on the Equivalence between 2D and 3D Classical Snakes and Geodesic Active Contours (1999)
    Springer
    International journal of computer vision 34 (1999), S. 19-28 
    Details
    ISSN: 1573-1405
    Keywords: geodesic active contours ; active surfaces ; Hamiltonian ; snakes ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Recently, Caselles et al. have shown the equivalence between a classical snake problem of Kass et al. and a geodesic active contour model. The PDE derived from the geodesic problem gives an evolution equation for active contours which is very powerfull for image segmentation since changes of topology are allowed using the level set implementation. However in Caselles' paper the equivalence with classical snake is only shown for 2D images and 1D curves, by using concepts of Hamiltonian theory which have no meanings for active surfaces. This paper propose to examine the notion of equivalence and to revisite Caselles et al. arguments. Then a notion equivalence is introduced and shown for classical snakes and geodesic active contours in the 2D (active contour) and 3D (active surface) case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008168219878
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    A Note on Error Bounds for Convex and Nonconvex Programs (1999)
    Springer
    Computational optimization and applications 12 (1999), S. 41-51 
    Details
    ISSN: 1573-2894
    Keywords: convex programming ; optimization ; duality ; error bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a single feasible solution $$x_F $$ and a single infeasible solution $$x_I $$ of a mathematical program, we provide an upper bound to the optimal dual value. We assume that $$x_F $$ satisfies a weakened form of the Slater condition. We apply the bound to convex programs and we discuss its relation to Hoffman-like bounds. As a special case, we recover a bound due to Mangasarian [11] on the distance of a point to a convex set specified by inequalities.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008659512824
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    A Scalable Parallel Interior Point Algorithm for Stochastic Linear Programming and Robust Optimization (1997)
    Springer
    Computational optimization and applications 7 (1997), S. 143-158 
    Details
    ISSN: 1573-2894
    Keywords: planning under uncertainty ; parallel computing ; optimization ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations.The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008675930362
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    A study of simulated annealing and a revised cascade algorithm for image reconstruction (1995)
    Springer
    Statistics and computing 5 (1995), S. 175-190 
    Details
    ISSN: 1573-1375
    Keywords: Image analysis ; MAP estimation ; optimization ; simulated annealing ; multi-resolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00142660
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    Optimal path generation for a simulated autonomous mobile robot (1995)
    Springer
    Autonomous robots 2 (1995), S. 11-27 
    Details
    ISSN: 1573-7527
    Keywords: mobile robot ; path ; optimization ; sliding mode ; adaptive control ; tracking strategy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The paper deals with a set of algorithms including path planning, trajectory planning, and path tracking for a tricycle type wheeled mobile robot. Path planning is carried out with parametric polynomial interpolation using an optimization algorithm based on robot geometric constraints. Trajectory characteristics are then derived from the planned geometric path with time varying parameters. A sliding mode control algorithm combined with an adaptive control law are used to track the planned trajectory. The technique deals with an environment free of obstacles. However, it can be easily integrated in a piecewise non colliding path generation. Simulation results are presented to show the validity of the different algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00735436
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 31
    Electronic Resource
    Electronic Resource
    A Microeconomic View of Data Mining (1998)
    Springer
    Data mining and knowledge discovery 2 (1998), S. 311-324 
    Details
    ISSN: 1573-756X
    Keywords: market segmentation ; optimization ; clustering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decision-making. This framework leads quickly to some interesting computational problems related to sensitivity analysis, segmentation and the theory of games.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009726428407
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...