102291 search results - page 20006 / 20459 » Computability in Computational Geometry |
201
Voted
IPCO
2004
15 years 8 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
166
Voted
ISCAPDCS
2004
15 years 8 months ago
2004
This paper shows that a novel network called the fat-stack is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection n...
165
Voted
ISCAPDCS
2004
15 years 8 months ago
2004
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
187
click to vote
DLOG
2003
15 years 8 months ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
192
Voted
DLOG
2003
15 years 8 months ago
2003
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...