Sciweavers

1920 search results - page 34 / 384
» The Complexity of the A B C Problem
Sort
View
ACSC
2006
IEEE
15 years 12 months ago
Programming with heterogeneous structures: manipulating XML data using bondi
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
F. Y. Huang, C. B. Jay, David B. Skillicorn
SPAA
2003
ACM
15 years 11 months ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
ISLPED
2005
ACM
103views Hardware» more  ISLPED 2005»
15 years 11 months ago
A technique for low energy mapping and routing in network-on-chip architectures
Network-on-chip (NoC) has been proposed as a solution for the global communication challenges of System-on-chip (SoC) design in the nanoscale technologies. NoC design with mesh ba...
Krishnan Srinivasan, Karam S. Chatha
ORL
1998
116views more  ORL 1998»
15 years 5 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
CISIS
2009
IEEE
15 years 3 months ago
Making Expert Knowledge Explicit to Facilitate Tool Support for Integrating Complex Information Systems in the ATM Domain
The capability to provide a platform for flexible business services in the Air Traffic Management (ATM) domain is both a major success factor for the ATM industry and a challenge ...
Thomas Moser, Richard Mordinyi, Alexander Mikula, ...