Filters








22,172 Hits in 9.5 sec

Computing time as a program variable: a way around infeasible paths

Niklas Holsti, Marc Herbstritt
2008
This paper explores another approach that uses a more direct connection between variable values and execution time. The execution time is modeled as a program variable.  ...  An analysis of the dependencies between variables, including the executiontime variable, gives a WCET bound that excludes many infeasible paths.  ...  execution time as a variable in the computation.  ... 
doi:10.4230/oasics.wcet.2008.1660 fatcat:p2hii3o2fnc5jipfmp3yw3hpce

Hybridizing RRT and variable-length genetic algorithm for smooth path generation

Chun-Hao Wei, Jing-Sin Liu
2011 2011 IEEE International Conference on Robotics and Biomimetics  
A smooth path generation scheme based on integrating rapidly-exploring random tree (RRT) with island parallel variable-length genetic algorithm with migration is presented for finding G 3 -continuous η  ...  3 -spline paths that minimize a quality measure combining path length and curvature.  ...  An island parallel variable-length genetic algorithm (IPVLGA) is employed as a path computing and optimization scheme.  ... 
doi:10.1109/robio.2011.6181356 dblp:conf/robio/WeiL11 fatcat:zrtri2wqp5fwhiuymnh6dycoo4

An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems [article]

Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
2021 arXiv   pre-print
For a 2VPI system with n variables and m constraints, our algorithm runs in O(mn) iterations.  ...  (ii) We obtain a strongly polynomial label-correcting algorithm for solving linear feasibility systems with two variables per inequality (2VPI).  ...  This returns a feasible solution or reports infeasibility within O(m) iterations. As every iteration takes O(mn) time, our overall algorithm terminates in O(m 2 n 2 ) time.  ... 
arXiv:2004.08634v4 fatcat:j4kqkgypfzhqxhlrbx6icqy7hq

Linear Programming with Two Variables Per Inequality in Poly-Log Time

George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
1990 SIAM journal on computing (Print)  
Let n and m denote the number of variables and the number of inequalities, respectively, in a linear programming problem.  ...  When the problem is feasible a solution can be computed within the same complexity.  ...  Similarly, i f w e apply FORWARD around a cycle, starting and ending at some vertex x (using x as an indeterminate), then we m a y obtain some bounds on x, possibly thereby p r o ving infeasibility.  ... 
doi:10.1137/0219068 fatcat:6adhvm5cgrdfvicpq7fj2vuhqq

Linear programming with two variables per inequality in poly-log time

G S Lueker, N Megiddo, V Ramachandran
1986 Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86  
Let n and m denote the number of variables and the number of inequalities, respectively, in a linear programming problem.  ...  When the problem is feasible a solution can be computed within the same complexity.  ...  Similarly, i f w e apply FORWARD around a cycle, starting and ending at some vertex x (using x as an indeterminate), then we m a y obtain some bounds on x, possibly thereby p r o ving infeasibility.  ... 
doi:10.1145/12130.12150 dblp:conf/stoc/LuekerMR86 fatcat:o5lf6fbyibhtjfx6hehyo4fim4

Recursive Variable Neighborhood Search

Mohammad R. Raeesi N., Ziad Kobti
2014 International Journal of Machine Learning and Computing  
Index Terms-Job shop scheduling problem, recursive programing, variable neighborhood search.  ...  Variable Neighborhood Search (VNS) is one of the most recent metaheuristics to solve optimization problems. A new variant of VNS is introduced in this article called Recursive VNS (R-VNS).  ...  A schedule may have more than one critical path and an operation may be located on different critical paths at the same time.  ... 
doi:10.7763/ijmlc.2014.v4.422 fatcat:j26w3gb5ebgqbpcdoz7itajigq

Robust combinatorial optimization with variable cost uncertainty

Michael Poss
2014 European Journal of Operational Research  
We suppose here that the budget of uncertainty is given by a function of the problem variables, yielding an uncertainty multifunction.  ...  We evaluate numerically the reduction in the price of robustness obtained with the new model on the shortest path problem and on a survivable network design problem.  ...  For general uncertainty polytopes U, the linear programming relaxation of problem (3) can be reformulated as a linear program, while the discrete problem (3) can be reformulated as a mixed-integer linear  ... 
doi:10.1016/j.ejor.2014.02.060 fatcat:zdcu75xperhgxlesatnhn7yxsa

The importance of pointer variables in constraint models

Brad Vander Zanden, Brad A. Myers, Dario Giuse, Pedro Szekely
1991 Proceedings of the 4th annual ACM symposium on User interface software and technology - UIST '91  
Constraints that use pointer variables are powerful enough to allow a comprehensive user interface toolkit to be built for the first time on top of a constraint system.  ...  It also promotes a simpler, more effective style of programming than conventional constraints.  ...  The first time this path is evaluated, the constraint solver can cache the resulting pointer to the box, so that as long as the variables comprising the path do not change, the constraint behaves as a  ... 
doi:10.1145/120782.120799 dblp:conf/uist/ZandenMGS91 fatcat:cx6n3qwovrcvhcv74dqarxucsq

Variable-Horizon Guidance for Autonomous Rendezvous and Docking to a Tumbling Target [article]

Mirko Leomanni, Renato Quartullo, Gianni Bianchini, Andrea Garulli, Antonio Giannitrapani
2021 arXiv   pre-print
The main contribution is to show that such problem can be tackled effectively by solving a finite number of linear programs.  ...  The use of a variable planning horizon is proposed in order to construct an appropriate maneuver plan, within an optimization-based framework.  ...  Variable-horizon optimal control problems can be addressed either in a continuous-time or in a discrete-time setting.  ... 
arXiv:2107.07254v4 fatcat:n543zxw37jbjzoixm43zbqqiga

Variable instruction set architecture and its compiler support

J. Liu, F. Chow, T. Kong, R. Roy
2003 IEEE transactions on computers  
Over time, compile-time configurability will pave the way for many high-performance devices to be built around this processor technology ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers  ...  times of the leaf nodes (with no successor) of the DAG, as follows: bound, max ry + | We define the downward critical path from operations i as the longest path from i to a leaf operation in the DAG and  ... 
doi:10.1109/tc.2003.1214337 fatcat:pdbma3kt7rd65cxo3qj75af5cq

Ancestor Relations in the Presence of Unobserved Variables [chapter]

Pekka Parviainen, Mikko Koivisto
2011 Lecture Notes in Computer Science  
An exact dynamic programming algorithm to compute the respective posterior probabilities is developed, under the complete data assumption.  ...  Bayesian networks (BNs) are an appealing model for causal and noncausal dependencies among a set of variables.  ...  For larger networks on, say, more than 20 nodes, the dynamic programming algorithm becomes computational infeasible and one has to resort to heuristic methods, in particular, Markov chain Monte Carlo  ... 
doi:10.1007/978-3-642-23783-6_37 fatcat:oivxhxxe6fa4jog5ocfabqdcqu

Modelling with integer variables [chapter]

R. G. Jeroslow, J. K. Lowe
1984 Mathematical programming study  
Rardin and Choe 140] disaggregate relevant constraints of a fixedcharge multicommodity network flow problem by way of an arc-node representation which explictly defines each possible path from each source  ...  CPU time involves only the actual computer time used in solving the The time recorded excludes input and output times since these are negligible on large problems.The number of nodes solved as L.Ps includes  ...  binary variables codes, but general mixed-integer codes. a. 157  ... 
doi:10.1007/bfb0121015 fatcat:ttq3itmddrcb5ojyz2uubyqhru

Change impact analysis for maintenance and evolution of variable software systems

Florian Angerer, Andreas Grimmer, Herbert Prähofer, Paul Grünbacher
2019 Automated Software Engineering : An International Journal  
Variability-aware program analysis techniques have been proposed for analyzing the space of program variants.  ...  This article presents an interprocedural and configuration-aware change impact analysis (CIA) approach for determining the possibly impacted source code elements when changing the source code of a product  ...  creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a  ... 
doi:10.1007/s10515-019-00253-7 fatcat:prn6bluppzc5zinwaq7mx7bfee

Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

Dorit S. Hochbaum, Joseph (Seffi) Naor
1994 SIAM journal on computing (Print)  
Shostak [18] suggested that a linear program with two variables per inequality can be represented as a graph" since each inequality contains two variables, one can represent the linear program by a graph  ...  However, it is shown that both a feasible solution and an optimal solution with respect to an arbitrary objective function can be computed in pseudo-polynomial time.  ...  This preprocessing stage runs in strongly polynomial time for the case of linear programs with two variables per inequality.  ... 
doi:10.1137/s0097539793251876 fatcat:4b7fuvt7arhkdhpsuusigyrpci

Integrating pointer variables into one-way constraint models

Brad Vander Zanden, Brad A. Myers, Dario A. Giuse, Pedro Szekely
1994 ACM Transactions on Computer-Human Interaction  
Pointer variables have long been considered useful for constructing and manipulating data structures in traditional programming languages.  ...  Constraints that use pointer variables have been implemented in a comprehensive user interface toolkit, Garnet, and our experiences with applications written in Garnet have proven the usefulness of pointer-variable  ...  for research on pointer variables.  ... 
doi:10.1145/180171.180174 fatcat:qpxioe3atvcjzjgvzmqfwhwfoi
« Previous Showing results 1 — 15 out of 22,172 results