4114 search results - page 605 / 823 » Efficient Algorithms for the 2-Center Problems |
153
Voted
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
164
click to vote
NETGAMES
2004
ACM
15 years 11 months ago
2004
ACM
We propose a fully-distributed peer-to-peer architecture to solve the scalability problem of Networked Virtual Environment in a simple and efficient manner. Our method exploits lo...
128
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
The daily use of Internet-based services is involved with hundreds of different tasks being performed by multiple users. A single task is typically involved with a sequence of Web...
157
Voted
CIS
2004
Springer
15 years 11 months ago
2004
Springer
To solve the problems we now encounter in web mining, We first propose a new distributed computing strategy——web service. It suggests building a web mining system based on web ...
158
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...