Results 1 - 10 of 5,013

Characterizing the Run-time Behavior of Stochastic Local Search

by Holger H. Hoos, Thomas Stützle - IN PROCEEDINGS AAAI99 , 1998
"... Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. One important feature of SLS algorithms is the fact that their run-time behavior is characterized by a random variable. Consequently, the detailed knowledge of the run-time ..."
Abstract - Cited by 28 (4 self) - Add to MetaCart
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. One important feature of SLS algorithms is the fact that their run-time behavior is characterized by a random variable. Consequently, the detailed knowledge of the run-time

Run-time Behavior of Contour Tracing Algorithms for Document Conversion

by Paul C K Kwok, Lok C Wong
"... In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based on Capson ..."
Abstract - Add to MetaCart
In this paper, we present the run-time behavior of contour tracing algorithms for processing large documents, in a contemporary workstation environment. The performance criteria examined are processing time, memory usage, and the number of page faults. A new contour tracing algorithm based

From Run-time Behavior to Usage Scenarios: An Interaction-Pattern Mining Approach

by Mohammad El-Ramly, Eleni Stroulia, Paul Sorenson - In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2002
"... A key challenge facing IT organizations today is their evolution towards adopting e-business practices that gives rise to the need for reengineering their underlying software systems. Any reengineering effort has to be aware of the functional requirements of the subject system, in order not to viola ..."
Abstract - Cited by 23 (2 self) - Add to MetaCart
-pattern mining method for the recovery of functional requirements as usage scenarios. Our method analyzes traces of the run-time system-user interaction to discover frequently recurring patterns; these patterns correspond to the functionality currently exercised by the system users, represented as usage

Reflective Analysis and Design for Adapting Object Run-time Behavior

by Walter Cazzola, Ahmed Ghoneim, Gunter Saake - Proceedings of the 8th International Conference on Object-Oriented Information Systems (OOIS’02), Lecture Notes in Computer Science 2425
"... Abstract. Today, complex information systems need a simple way for changing the object behavior according with changes that occur in its running environment. We present a reflective architecture which provides the ability to change object behavior at run-time by using design-time information. By int ..."
Abstract - Cited by 8 (6 self) - Add to MetaCart
Abstract. Today, complex information systems need a simple way for changing the object behavior according with changes that occur in its running environment. We present a reflective architecture which provides the ability to change object behavior at run-time by using design-time information

Investigating Run-Time Behavior of Distributed Semiconductor Manufacturing Simulation through Emulation of Distributed Environment

by unknown authors
"... Simulating semiconductor operations becomes a progressively more complex endeavor, as an increasing number of sub-system components need to be evaluated in order to assure proper overall system operation. As the models get more and more complex, the simulation run-time becomes progressively large. P ..."
Abstract - Add to MetaCart
. Parallel Discrete Event Simulation (PDES) is a methodology that allows a model to execute faster by distributing portions of the model on several processors. This work investigates the run-time characteristics of a simplified distributed semiconductormanufacturing model. The distributed behavior

Research on running time behavior analyzing and trend predicting of modern distributed software

by Junfeng Man, Zhicheng Wen, Changyun Li, Xiangbing Wen
"... Abstract—Interactive behavior trust of modern distributed software systems (MDSS) should be “monitored ” and “grasped ” at running time. The paper investigates the relationships between behaviors and their effects at running time in MDSS, uses statistical machine learning tools to analyze the laws o ..."
Abstract - Add to MetaCart
Abstract—Interactive behavior trust of modern distributed software systems (MDSS) should be “monitored ” and “grasped ” at running time. The paper investigates the relationships between behaviors and their effects at running time in MDSS, uses statistical machine learning tools to analyze the laws

Lightweight Run-Time Code Generation

by Mark Leone, Peter Lee - Department of Computer Science, University of Melbourne , 1994
"... Run-time code generation is an alternative and complement to compile-time program analysis and optimization. Static analyses are inherently imprecise because most interesting aspects of run-time behavior are uncomputable. By deferring aspects of compilation to run time, more precise information abou ..."
Abstract - Cited by 55 (5 self) - Add to MetaCart
Run-time code generation is an alternative and complement to compile-time program analysis and optimization. Static analyses are inherently imprecise because most interesting aspects of run-time behavior are uncomputable. By deferring aspects of compilation to run time, more precise information

Randomized Algorithms

by Rajeev Motwani , 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract - Cited by 2196 (36 self) - Add to MetaCart
, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from

Pfinder: Real-time tracking of the human body

by Christopher Richard Wren, Ali Azarbayejani, Trevor Darrell, Alex Paul Pentland - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1997
"... Pfinder is a real-time system for tracking people and interpreting their behavior. It runs at 10Hz on a standard SGI Indy computer, and has performed reliably on thousands of people in many different physical locations. The system uses a multiclass statistical model of color and shape to obtain a 2D ..."
Abstract - Cited by 1482 (48 self) - Add to MetaCart
Pfinder is a real-time system for tracking people and interpreting their behavior. It runs at 10Hz on a standard SGI Indy computer, and has performed reliably on thousands of people in many different physical locations. The system uses a multiclass statistical model of color and shape to obtain a 2

A theory of social comparison processes,”

by Leon Festinger - Human Relations, , 1954
"... In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison is i ..."
Abstract - Cited by 1318 (0 self) - Add to MetaCart
and depends more on actual comparison of one's performance with the performance of others. Thus, if a person evaluates his running ability, he will do so by comparing his time to run some distance with the times that other persons have taken. In the following pages, when we talk about evaluating
Results 1 - 10 of 5,013