Sciweavers

6274 search results - page 500 / 1255
» From query complexity to computational complexity
Sort
View
ICSM
2007
IEEE
16 years 1 months ago
On the prediction of the evolution of libre software projects
Libre (free / open source) software development is a complex phenomenon. Many actors (core developers, casual contributors, bug reporters, patch submitters, users, etc.), in many ...
Israel Herraiz, Jesús M. González-Ba...
LICS
2007
IEEE
16 years 1 months ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
IWINAC
2007
Springer
16 years 1 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
IEEEPACT
2006
IEEE
16 years 1 months ago
Branch predictor guided instruction decoding
Fast instruction decoding is a challenge for the design of CISC microprocessors. A well-known solution to overcome this problem is using a trace cache. It stores and fetches alrea...
Oliverio J. Santana, Ayose Falcón, Alex Ram...
QSHINE
2005
IEEE
16 years 16 days ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves