3280 search results - page 300 / 656 » Design Families and Design Individuals |
186
click to vote
UAI
2001
15 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
207
click to vote
AAAI
2000
15 years 8 months ago
2000
The paper generalizes the notion of a social law, the foundation of the theory of artificial social systems developed for coordinating Multi-Agent Systems. In an artificial social...
181
click to vote
UAI
1996
15 years 8 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
179
click to vote
DAM
2008
15 years 7 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
198
click to vote
EOR
2008
15 years 7 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...