Sciweavers

4488 search results - page 664 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
171
Voted
WCE
2007
15 years 8 months ago
Metaplanning Model Based in an Organizational Memory
— When problems are present in production, equipment or the process which are critical for organizations, many management personnel and experts have to meet to propose a solution...
José Bernardo Parra Victorino, Raúl ...
TSMC
2010
15 years 1 months ago
Particle Swarm Optimization With Composite Particles in Dynamic Environments
In recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with c...
Lili Liu, Shengxiang Yang, Dingwei Wang
CVPR
2009
IEEE
1385views Computer Vision» more  CVPR 2009»
17 years 2 months ago
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
This paper deals with the problem of tracking multiple targets in a distributed network of self-configuring pan-tilt-zoom cameras. We focus on applications where events unfold over...
Amit K. Roy Chowdhury, Bi Song, Cristian Soto
ANSS
2005
IEEE
16 years 21 days ago
An Extensible Platform for Evaluating Security Protocols
We present a discrete-event network simulator, called Simnet, designed specifically for analyzing networksecurity protocols. The design and implementation is focused on simplicit...
Seny Kamara, Darren Davis, Lucas Ballard, Ryan Cau...