Skip to main content
This paper highlights two of the ways in which an abundance of frequent and high-quality information can nonetheless lead an economic agent to failure. I begin with the problem of frequent information, continue with the problem of... more
    • by 
    •   388  
      Critical TheoryBusinessOrganizational BehaviorInformation Systems
    • by 
    •   3  
      HeuristicsMultidisciplinaryTraveling Salesman Problem
    • by 
    •   14  
      Distributed ComputingHeuristicsFPGARapid Prototyping
    • by  and +1
    • Heuristics
    • by 
    •   9  
      GeneticsApplied MathematicsHeuristicsGenetic Algorithm
    • by 
    •   10  
      PhilosophyMetaphysicsOntologyAesthetics
This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE. The algorithms are based on improvements and variations of previously-studied algorithms by the authors. Three kinds of adaptation are studied:... more
    • by 
    •   7  
      Applied MathematicsHeuristicsAdaptationGreedy Algorithm
    • by 
    •   27  
      PsychologyCognitive ScienceDecision MakingHeuristics
    • by 
    •   9  
      HeuristicsCADData StructureData Structures
    • by 
    •   3  
      HeuristicsBehavioral FinanceExperience Design
    • by 
    •   9  
      Computer ScienceArtificial IntelligenceHeuristicsCognition
    • by 
    •   10  
      HeuristicsMultiple Instance LearningQuality of ServiceGlobal Optimization
    • by 
    •   18  
      PsychologyCognitive PsychologyCognitive ScienceHeuristics
    • by 
    •   5  
      HeuristicsBehavioral Decision MakingMultidisciplinaryUtility
    • by  and +1
    •   5  
      Transformative LearningHeuristicsNumeracyLearning
— Objective of this paper is to test and compare different solution algorithms for solving nonlinear freeway traffic control problems. The motivation of this work is related to the fact that the nonlinear problems arising in freeway... more
    • by  and +1
    •   4  
      HeuristicsTraffic controlMeta-Heuristics (Tabu Search, Genetic Algorithms, Simulated Annealing, Ant-Colony, Particle Swarm Optimization)HIGHWAY ROADS AND BRIDGES
    • by 
    •   20  
      Computer ScienceDistributed ComputingHeuristicsRouting
    • by 
    •   19  
      Applied MathematicsHeuristicsLogisticsTabu Search
    • by 
    •   20  
      Vlsi DesignCombinatorial OptimizationHeuristicsGraph Theory
    • by  and +1
    •   3  
      HeuristicsCost AnalysisSpare Parts
    • by 
    •   10  
      PsychologyCognitive ScienceSocial SciencesHeuristics
    • by 
    •   12  
      Applied MathematicsHeuristicsTabu SearchSimulated Annealing
The aim of this work is to propose a simple and efficient mechanism to deal with the problem of executing sequential code in a pure dataflow machine. Our results is obtained with a simulator of Wolf architecture. The implemented mechanism... more
    • by 
    •   12  
      Computer ScienceComputer ArchitectureHigh Performance ComputingPhysics
    • by 
    •   6  
      HeuristicsUser InterfaceVisual basicMathematical Sciences
    • by 
    •   4  
      HeuristicsEvolutionary ComputationOptimizationMathematical Sciences
    • by 
    •   6  
      HeuristicsExperiential LearningSecond LanguageTheory into practice
    • by 
    •   20  
      HeuristicsPure MathematicsExperimental DesignLinear Model
    • by 
    •   11  
      Information SystemsApplied MathematicsHeuristicsMonte Carlo Simulation
    • by  and +1
    •   7  
      Applied MathematicsHeuristicsPerformance AnalysisJob shop scheduling
    • by 
    •   8  
      Applied MathematicsHeuristicsFuel CellVehicle routing
    • by 
    •   11  
      HeuristicsSimulated AnnealingSchedulingConstraint Programming
    • by 
    •   4  
      HeuristicsInteger ProgrammingMultidisciplinaryConfidence Interval
    • by 
    •   6  
      Applied MathematicsHeuristicsLocal SearchPath Relinking
    • by 
    •   8  
      EngineeringHeuristicsOptimizationMathematical Sciences
    • by 
    • Heuristics
The paper presents Greedy Randomized Adaptive Search Procedure with Path Relinking (GRASP with PR) for the Critical Node Detection Problem (CNDP). An evolutionary Path Relinking mechanism is added to GRASP with PR to intensify. Our... more
    • by 
    • Heuristics
    • by 
    •   5  
      Mathematical PhysicsHeuristicsClassical PhysicsAnalysis of Algorithms
    • by 
    •   6  
      Applied MathematicsHeuristicsNetwork FlowsGlobal Warming
    • by 
    •   3  
      HeuristicsPure MathematicsBoolean Satisfiability
    • by 
    •   12  
      HeuristicsWriting Systems & DeciphermentCryptographyDecipherment of Unknown Languages
    • by  and +3
    •   12  
      Applied MathematicsHeuristicsInventory ControlBusiness and Management
    • by  and +1
    •   6  
      HeuristicsTabu SearchMultidisciplinaryProduction Scheduling
    • by 
    •   5  
      Applied MathematicsHeuristicsMaximum Clique ProblemGreedy Algorithm
    • by 
    •   10  
      HeuristicsInventory ControlProduction PlanningGenetic Algorithm
    • by 
    •   7  
      HeuristicsTelecommunicationsMultidisciplinaryNetwork Design
An appropriate tabu search implementation is designed to solve the resource constrained project scheduling problem. This approach uses well defined move strategies and a structured neighbourhood, defines appropriate tabu status and tenure... more
    • by 
    •   5  
      Applied MathematicsHeuristicsTabu SearchProject manager
    • by 
    •   10  
      HeuristicsComputer Aided DesignFault DetectionComputer Hardware
    • by 
    •   2  
      Applied MathematicsHeuristics
    • by  and +3
    •   2  
      Information RetrievalHeuristics
    • by 
    •   2  
      Applied MathematicsHeuristics