Výsledky vyhledávání - "Optimization—Integer programming"

A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems Autor Burke, Edmund K., Li, Jingpeng, Qu, Rong

“…This paper presents a hybrid multi-objective model that combines integer programming (IP) and variable neighbourhood search (VNS) to deal with…”
Získat plný text

Formulating Data-arrival Synchronizers in Integer Linear Programming for CGRA Mapping Autor Guo, Yijiang, Wang, Jiarui, Zhang, Jiaxi, Luo, Guojie

“…Coarse-grained reconfigurable architecture (CGRA) is a promising programmable device with high performance and power efficiency. The CGRA compilation problem…”
Získat plný text

Research on Multilevel Network Optimization of Urban Underground Logistics in Megaloplis Autor Boyu LIU, Chengji LIANG, Yu WANG

“…With the continuous advancement of urbanization in China, the urban population and the number of vehicles continue to increase. Air pollution and traffic…”
Získat plný text

TritonRoute: An Initial Detailed Router for Advanced VLSI Technologies Autor Kahng, Andrew B., Wang, Lutong, Xu, Bangqi

“…Detailed routing is a dead-or-alive critical element in design automation tooling for advanced node enablement. However, very few works address detailed…”
Získat plný text

Adaptable and Divergent Synthetic Benchmark Generation for Hardware Security Autor Amir, Sarah, Forte, Domenic

“…Benchmarking can drive the development of technologies by facilitating standardization of features for comparison of different methods. While hardware security…”
Získat plný text

Scheduling inspired models for two-dimensional packing problems Autor Castro, Pedro M., Oliveira, José F.

“…► 1-D concepts for time representation are combined for 2-D packing problems. ► Two MILP models are proposed. ► Hybrid discrete/continuous-space model better…”
Získat plný text

Upper bounds and heuristics for the 2-club problem Autor Carvalho, Filipa D., Almeida, M. Teresa

“…Given an undirected graph G = ( V, E), a k-club is a subset of V that induces a subgraph of diameter at most k. The k-club problem is that of finding the…”
Získat plný text

Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads Autor Dolgui, A., Ihnatsenka, I.

“…In this paper, a new transfer line balancing problem is considered. The main difference from the simple assembly line balancing problem is that the operations…”
Získat plný text

Tight bounds for periodicity theorems on the unbounded Knapsack problem Autor Huang, Ping H., Lawley, Mark, Morin, Thomas

“…► Developed three new periodicity bounds for UKP. ► Proved each new bound is tight. ► Showed two new bounds subsume known results. Three new bounds for…”
Získat plný text

Species-specific spatial characteristics in reserve site selection Autor Groeneveld, Rolf A.

“…This paper addresses the problem of selecting reserve sites cost-effectively, taking into account the mobility and habitat area requirements of each species…”
Získat plný text

A High Performance Detailed Router Based on Integer Programming with Adaptive Route Guides Autor Qi, Zhongdong, Hu, Shizhe, Peng, Qi, You, Hailong, Han, Chao, Zhu, Zhangming

“…Detailed routing is a crucial and time-consuming stage for ASIC design. As the number and complexity of design rules increase, it is challenging to achieve…”
Získat plný text

A fast pseudo-boolean constraint solver Autor Chai, Donald, Kuehlmann, Andreas

“…Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Boolean functions and provide a significant extension of the…”
Získat plný text

Pueblo: A Modern Pseudo-Boolean SAT Solver Autor Sheini, Hossein M., Sakallah, Karem A.

“…This paper introduces a new SAT solver that integrates logic-based reasoning and integer programming methods to systems of CNF and PB constraints. Its novel…”
Získat plný text

Effective bounding techniques for solving unate and binate covering problems Autor Li, Xiao Yu, Stallmann, Matthias F., Brglez, Franc

“…Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically…”
Získat plný text

Critical path analysis using a dynamically bounded delay model Autor Hassoun, Soha

“…This paper focuses on static timing analysis in the presence of capacitive coupling. We propose a novel gate delay model, the dynamically bounded delay model…”
Získat plný text

A faster optimal register allocator Autor Fu, Changqing, Wilken, Kent

“…Recently researchers have proposed modeling register allocation as an integer linear programming (IP) problem and solving it optimally for general purpose…”
Získat plný text

Optimizing customized program coverage Autor Ohmann, Peter, Brown, David Bingham, Neelakandan, Naveen, Linderoth, Jeff, Liblit, Ben

“…Program coverage is used across many stages of software development. While common during testing, program coverage has also found use outside the test lab, in…”
Získat plný text

Voltage scheduling problem for dynamically variable voltage processors Autor Ishihara, Tohru, Yasuura, Hiroto

“…This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is…”
Získat plný text

Web User Session Reconstruction Using Integer Programming Autor Dell, Robert F., Román, Pablo E., Velásquez, Juan D.

“…An important input for web usage mining is web user sessions that must be reconstructed from web logs (sessionization) when such sessions are not otherwise…”
Získat plný text

Automatic selection of application-specific instruction-set extensions Autor Galuzzi, Carlo, Panainte, Elena Moscu, Yankova, Yana, Bertels, Koen, Vassiliadis, Stamatis

“…In this paper, we present a general and an efficient algorithm for automatic selection of new application-specific instructions under hardware resources…”
Získat plný text