Results 271 to 280 of about 414,341 (317)
Some of the next articles are maybe not open access.
Proceedings Ninth Great Lakes Symposium on VLSI, 2003
One of the foremost problems in physical design for deep-submicron circuits is the need for estimates that depend on future decisions. Estimation of area, timing, and coupling are required. We propose a novel floorplanner, with a new wiring metric, which can be updated quickly in small increments.
Jim E. Crenshaw +3 more
openaire +1 more source
One of the foremost problems in physical design for deep-submicron circuits is the need for estimates that depend on future decisions. Estimation of area, timing, and coupling are required. We propose a novel floorplanner, with a new wiring metric, which can be updated quickly in small increments.
Jim E. Crenshaw +3 more
openaire +1 more source
Incremental versus non-incremental dynamic programming
Operations Research Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mao-Lun Chiang +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mao-Lun Chiang +2 more
openaire +3 more sources
Networks, 2007
AbstractThis paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, incremental problems considered in the literature have been built on NP‐complete problems.
Jeff Hartline, Alexa Sharp
openaire +2 more sources
AbstractThis paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, incremental problems considered in the literature have been built on NP‐complete problems.
Jeff Hartline, Alexa Sharp
openaire +2 more sources
Incremental peritoneal dialysis: Incremental gains
Peritoneal Dialysis International: Journal of the International Society for Peritoneal Dialysis, 2023Arti, Dhoot +3 more
openaire +2 more sources
2006
Slicing is one of a number of techniques for reducing the state space of specifications during verification. Unlike techniques as e.g. data abstraction slicing is precise: the slice exactly reflects the property to be verified. This necessitates keeping large parts of the specification.
openaire +2 more sources
Slicing is one of a number of techniques for reducing the state space of specifications during verification. Unlike techniques as e.g. data abstraction slicing is precise: the slice exactly reflects the property to be verified. This necessitates keeping large parts of the specification.
openaire +2 more sources
(Incremental) Priority Algorithms
Algorithmica, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Allan Borodin +2 more
openaire +2 more sources
Strategic Management Journal, 1988
Abstract This paper discusses different notions of incremental strategic management and, on the basis of empirical data from a longitudinal study of strategic management, and existing research and theory, reconceives the subject within an ‘organization action’ framework.
openaire +1 more source
Abstract This paper discusses different notions of incremental strategic management and, on the basis of empirical data from a longitudinal study of strategic management, and existing research and theory, reconceives the subject within an ‘organization action’ framework.
openaire +1 more source
2006
Learning with adaptivity is a key issue in many nowadays applications. The most important aspect of such an issue is incremental learning (IL). This latter seeks to equip learning algorithms with the ability to deal with data arriving over long periods of time. Once used during the learning process, old data is never used in subsequent learning stages.
openaire +2 more sources
Learning with adaptivity is a key issue in many nowadays applications. The most important aspect of such an issue is incremental learning (IL). This latter seeks to equip learning algorithms with the ability to deal with data arriving over long periods of time. Once used during the learning process, old data is never used in subsequent learning stages.
openaire +2 more sources
On Appropriate Refractoriness and Weight Increment in Incremental Learning
2013Neural networks are able to learn more patterns with the incremental learning than with the correlative learning. The incremental learning is a method to compose an associate memory using a chaotic neural network. The capacity of the network is found to increase along with its size which is the number of the neurons in the network and to be larger than
Toshinori Deguchi +2 more
openaire +2 more sources

