Sciweavers

18306 search results - page 182 / 3662
» Algorithmics in Exponential Time
Sort
View
DAM
2006
79views more  DAM 2006»
14 years 10 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
85
Voted
ACSD
2009
IEEE
87views Hardware» more  ACSD 2009»
15 years 2 months ago
Saving Space in a Time Efficient Simulation Algorithm
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...
Silvia Crafa, Francesco Ranzato, Francesco Tapparo
79
Voted
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
15 years 4 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
100
Voted
JCP
2008
155views more  JCP 2008»
14 years 10 months ago
Algorithm to Optimize Code Size and Energy Consumption in Real Time Embedded System
Processor is an important computing element in portable battery operated real time embedded system and it consumes most of the battery energy. Energy consumption, processor memory ...
Santosh D. Chede, Kishore D. Kulat
67
Voted
ESA
2007
Springer
93views Algorithms» more  ESA 2007»
15 years 4 months ago
Polynomial Time Algorithms for Minimum Energy Scheduling
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
Philippe Baptiste, Marek Chrobak, Christoph Dü...