Sciweavers

4340 search results - page 577 / 868
» Formal Methods and Cryptography
Sort
View
VG
2001
15 years 8 months ago
A Study of Transfer Function Generation for Time-Varying Volume Data
The proper usage and creation of transfer functions for time-varying data sets is an often ignored problem in volume visualization. Although methods and guidelines exist for time-i...
T. J. Jankun-Kelly, Kwan-Liu Ma
192
Voted
IJCAI
2003
15 years 8 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
AAAI
2000
15 years 8 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
APCCM
2009
15 years 7 months ago
Towards Accurate Conflict Detection in a VCS for Model Artifacts: A Comparison of Two Semantically Enhanced Approaches
In collaborative software development the utilization of Version Control Systems (VCSs) is a must. For this important task some graph-based VCSs for model artifacts already emerge...
Kerstin Altmanninger, Gabriele Kotsis
EOR
2006
130views more  EOR 2006»
15 years 6 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni