Sciweavers

5090 search results - page 135 / 1018
» Constructing Strategies for Programming
Sort
View
IOR
2011
133views more  IOR 2011»
13 years 4 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
IEEEARES
2006
IEEE
14 years 3 months ago
Evaluation of Network Robustness for Given Defense Resource Allocation Strategies
Since the 9/11 terrorist attacks, the effective and efficient protection of critical information infrastructures has become an even more important issue. To enhance network surviv...
Y.-S. Lin, P.-H. Tsang, C.-H. Chen, C.-L. Tseng, Y...
CCIA
2005
Springer
14 years 2 months ago
Comparison of Strategies Based on Evolutionary Computation for the Design of Similarity Functions
One of the main keys in case-based reasoning system is the retrieval phase, where the most similar cases are retrieved by means of a similarity function. According to the problem, ...
Albert Fornells-Herrera, J. Camps Dausà, El...
MATES
2005
Springer
14 years 2 months ago
A Goal Deliberation Strategy for BDI Agent Systems
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for dec...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...
PPDP
2005
Springer
14 years 2 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...