Sciweavers

4451 search results - page 427 / 891
» On Random Ordering Constraints
Sort
View
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
16 years 5 days ago
Comparison of Test Pattern Decompression Techniques
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
Ondrej Novák
ICTAI
2003
IEEE
16 years 5 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
ICDCS
2002
IEEE
15 years 12 months ago
Routing Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
Arturo Crespo, Hector Garcia-Molina
EMO
2001
Springer
109views Optimization» more  EMO 2001»
15 years 11 months ago
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
Tadahiko Murata, Hisao Ishibuchi, Mitsuo Gen
INFOCOM
2000
IEEE
15 years 11 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...